On making a distinguished vertex of minimum degree by vertex deletion

DOI10.1007/s00453-012-9695-6zbMath1360.68492WikidataQ59567485 ScholiaQ59567485MaRDI QIDQ528861

Rolf Niedermeier, Hans L. Bodlaender, Robert Bredereck, Johannes Uhlmann, Nadja Betzler

Publication date: 17 May 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9695-6

zbMATH Keywords

treewidth; parameterized complexity; graph modification problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• ComputeTW