Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:45, 1 February 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
