The cluster deletion problem for cographs
From MaRDI portal
cliquescluster deletioncographsedge-deletionfixed-parameter tractabilitygraph modificationinteger partitions
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- A Linear Recognition Algorithm for Cographs
- A novel branching strategy for parameterized graph modification problems
- Algorithmic graph theory and perfect graphs
- Bounded-degree techniques accelerate some parameterized graph algorithms
- Cluster editing with locally bounded modifications
- Cluster graph modification problems
- Correlation clustering
- Even faster parameterized cluster deletion and cluster editing
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Four classes of perfectly orderable graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 2011849 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- Improved algorithms for weakly chordal graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- The ellipsoid method and its consequences in combinatorial optimization
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(26)- Cluster deletion on interval graphs and split related graphs
- Indirect identification of horizontal gene transfer
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Cluster deletion revisited
- A new approximate cluster deletion algorithm for diamond-free graphs
- Faster algorithms for cograph edge modification problems
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- On the d-claw vertex deletion problem
- Defining and identifying cograph communities in complex networks
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Cluster deletion on interval graphs and split related graphs
- Cograph editing: Merging modules is equivalent to editing P₄s
- A polynomial-time algorithm for cluster deletion on (diamond, Butterfly)-free graphs
- Strong triadic closure in cographs and graphs of low maximum degree
- Structural parameterization of cluster deletion
- On the parameterized complexity of s-club cluster deletion problems
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- When can cluster deletion with bounded weights be solved efficiently?
- Representing distance-hereditary graphs with multi-rooted trees
- Exact and heuristic solution approaches for the cluster deletion problem on general graphs
- Structural parameterization of cluster deletion
- Covering and partitioning of split, chain and cographs with isometric paths
- Covering and partitioning of split, chain and cographs with isometric paths
- When can cluster deletion with bounded weights be solved efficiently?
- Cluster editing on cographs and related classes
- On the parameterized complexity of s-club cluster edge deletion
This page was built for publication: The cluster deletion problem for cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394219)
