Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05393MaRDI QIDQ5897563FDOQ5897563

Authors: Peter Damaschke 

Publication date: 1 November 2006

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

Recommendations

• Fixed-parameter enumerability of cluster editing and related problems
• Fixed-Parameter Tractable Generalizations of Cluster Editing
• Tight bounds for parameterized complexity of Cluster Editing
• On the complexity of multi-parameterized cluster editing
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• The Multi-parameterized Cluster Editing Problem
• The Cluster Editing Problem: Implementations and Experiments
• \((1,1)\)-cluster editing is polynomial-time solvable
• Exact algorithms for cluster editing: Evaluation and experiments
• Exact Algorithms for Cluster Editing: Evaluation and Experiments

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Fixed-Parameter Tractable Generalizations of Cluster Editing
• Parameterized enumeration for modification problems
• Tight bounds for parameterized complexity of Cluster Editing
• Fixed-parameter enumerability of cluster editing and related problems

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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