Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9575-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058133856 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} |
scientific article |
Statements
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (English)
0 references
5 March 2013
0 references
exact exponential-time algorithms
0 references
measure and conquer
0 references
parameterized algorithms
0 references
spanning tree problems
0 references
maximum internal spanning trees
0 references
