Editing the Simplest Graphs

DOI10.1007/978-3-319-04657-0_24zbMath1407.68350OpenAlexW43793112MaRDI QIDQ5746262

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

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

Related Items (4)

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes ⋮ Reducing Rank of the Adjacency Matrix by Graph Modification ⋮ 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