Editing simple graphs

DOI10.7155/JGAA.00337zbMATH Open1305.05220OpenAlexW2071563448MaRDI QIDQ2938751FDOQ2938751

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

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

Cited In (7)

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

   Recommendations

• Editing the simplest graphs 👍 👎
• On the clique editing problem 👍 👎
• Cluster editing with locally bounded modifications 👍 👎
• Title not available (Why is that?) 👍 👎
• Cluster graph modification problems 👍 👎

This page was built for publication: Editing simple graphs

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