Exact and Parameterized Algorithms for Max Internal Spanning Tree

DOI10.1007/978-3-642-11409-0_9zbMath1273.68167OpenAlexW1516297517MaRDI QIDQ5851097

Daniel Raible, Serge Gaspers, Henning Fernau

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems ⋮ Parameterized measure \& conquer for problems with no small kernels ⋮ Unnamed Item ⋮ Enumerate and Measure: Improving Parameter Budget Management

This page was built for publication: Exact and Parameterized Algorithms for Max Internal Spanning Tree