Editing the simplest graphs

DOI10.1007/978-3-319-04657-0_24zbMATH Open1407.68350OpenAlexW43793112MaRDI QIDQ5746262FDOQ5746262

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)