Edge-editing to a dense and a sparse graph class

DOI10.1007/978-3-662-49529-2_42MaRDI QIDQ2802969zbMATH OpenOpenAlexFDO

Authors Michal Kotrbčík, Rastislav Královič, Sebastian Ordyniak

Publication date 3 May 2016

Published in LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_42

zbMATH Keywords

clique-editingdegeneracygraph modification problemsparameterized complexitytreewidth

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The parameterized complexity of editing graphs for bounded degeneracy
• Editing graphs into disjoint unions of dense clusters
• Editing graphs into disjoint unions of dense clusters
• Graph editing to a given degree sequence
• Graph editing to a given degree sequence

Cited in

(3)

• Fixed-parameter tractable distances to sparse graph classes
• scientific article; zbMATH DE number 7525474 (Why is no real title available?)
• The parameterized complexity of editing graphs for bounded degeneracy

This page was built for publication: Edge-editing to a dense and a sparse graph class

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802969)