A Linear Vertex Kernel for Maximum Internal Spanning Tree
From MaRDI portal
Publication:3652213
DOI10.1007/978-3-642-10631-6_29zbMath1272.05197arXiv0907.3208OpenAlexW2570653565WikidataQ60488659 ScholiaQ60488659MaRDI QIDQ3652213
Serge Gaspers, Saket Saurabh, Fedor V. Fomin, Steéphan Thomassé
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3208
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ On the directed full degree spanning tree problem ⋮ Lower bounds on kernelization
