Editing Simple Graphs

DOI10.7155/jgaa.00337zbMath1305.05220OpenAlexW2071563448MaRDI QIDQ2938751

Olof Mogren, Peter Damaschke

Publication date: 15 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00337

zbMATH Keywords

critical-clique graphwell-structured word clusters

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes ⋮ Reducing rank of the adjacency matrix by graph modification ⋮ Parameterized algorithms for min-max 2-cluster editing ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Complexity of the cluster deletion problem on subclasses of chordal graphs ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics ⋮ (Sub)linear kernels for edge modification problems toward structured graph classes

This page was built for publication: Editing Simple Graphs