Fixed-Parameter Tractable Generalizations of Cluster Editing

DOI10.1007/11758471_33MaRDI QIDQ3434569zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_33

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fixed-parameter enumerability of cluster editing and related problems
• Alternative parameterizations for cluster editing
• Graph-Theoretic Concepts in Computer Science
• On the complexity of multi-parameterized cluster editing
• scientific article; zbMATH DE number 2011849

Cited in

(7)

• The Multi-parameterized Cluster Editing Problem
• Tight bounds for parameterized complexity of Cluster Editing
• Graph-based data clustering with overlaps
• Parameterized Dynamic Cluster Editing
• Graph-Based Data Clustering with Overlaps
• Graph-Theoretic Concepts in Computer Science
• Fixed-parameter enumerability of cluster editing and related problems

This page was built for publication: Fixed-Parameter Tractable Generalizations of Cluster Editing

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