Win-Win Kernelization for Degree Sequence Completion Problems

DOI10.1007/978-3-319-08404-6_17zbMath1417.68067arXiv1404.5432OpenAlexW2565254763MaRDI QIDQ3188894

André Nichterlein, Rolf Niedermeier, Vincent Froese

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5432

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Editing to a Planar Graph of Given Degrees ⋮ Editing to Eulerian graphs ⋮ Graph editing to a given degree sequence ⋮ Graph editing problems with extended regularity constraints ⋮ Graph Editing to a Given Degree Sequence ⋮ Editing to a graph of given degrees

This page was built for publication: Win-Win Kernelization for Degree Sequence Completion Problems