Editing the simplest graphs

DOI10.1007/978-3-319-04657-0_24MaRDI QIDQ5746262zbMATH OpenOpenAlexFDO

Authors Peter Damaschke, Olof Mogren

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04657-0_24

Mathematics Subject Classification ID

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

Recommendations

• Editing simple graphs
• On the clique editing problem
• Cluster editing with locally bounded modifications
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109

Cited in

(8)

• Graph editing to a fixed target
• On the clique editing problem
• Editing simple graphs
• Reducing rank of the adjacency matrix by graph modification
• Graph editing to a fixed target
• Editing graphs into few cliques: complexity, approximation, and kernelization schemes
• Matrix Rigidity from the Viewpoint of Parameterized Complexity
• Rank reduction of oriented graphs by vertex and edge deletions

This page was built for publication: Editing the simplest graphs

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