A faster algorithm for the cluster editing problem on proper interval graphs
DOI10.1016/J.IPL.2015.07.009zbMATH Open1338.68113OpenAlexW1424642028MaRDI QIDQ495665FDOQ495665
Min Chih Lin, Jayme L. Szwarcfiter, Francisco J. Soulignac
Publication date: 15 September 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.009
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- A golden ratio parameterized algorithm for cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- A \(2k\) kernel for the cluster editing problem
- Cluster Editing
- Cluster editing with locally bounded modifications
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Title not available (Why is that?)
- Graph-based data clustering with overlaps
- Cluster graph modification problems
- NP-hard problems in hierarchical-tree clustering
- Exact algorithms for cluster editing: Evaluation and experiments
- Fixed-parameter enumerability of cluster editing and related problems
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Cluster Editing with Locally Bounded Modifications Revisited
Cited In (1)
This page was built for publication: A faster algorithm for the cluster editing problem on proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495665)
