Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
From MaRDI portal
Publication:1939668
DOI10.1007/s00453-011-9575-5zbMath1259.05159MaRDI QIDQ1939668
Henning Fernau, Serge Gaspers, Mathieu Liedloff, Daniel Binkele-Raible
Publication date: 5 March 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9575-5
parameterized algorithms; measure and conquer; exact exponential-time algorithms; spanning tree problems; maximum internal spanning trees
68W40: Analysis of algorithms
05C05: Trees
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)