Applying modular decomposition to parameterized cluster editing problems
From MaRDI portal
Publication:2272201
Recommendations
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 1508917 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Fast Algorithm for the Decomposition of Graphs and Posets
- A More Effective Linear Kernelization for Cluster Editing
- A general method to speed up fixed-parameter-tractable algorithms
- A simple linear time LexBFS cograph recognition algorithm.
- Algorithm Theory - SWAT 2004
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Complexity classification of some edge modification problems
- Efficient and practical algorithms for sequential modular decomposition
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph-modeled data clustering: Exact algorithms for clique generation
- Matrix multiplication via arithmetic progressions
- SOFSEM 2005: Theory and Practice of Computer Science
- Transitiv orientierbare Graphen
Cited in
(39)- Improved Algorithms for Bicluster Editing
- Complexity and parameterized algorithms for cograph editing
- Cluster editing
- A faster algorithm for the cluster editing problem on proper interval graphs
- A Problem Kernelization for Graph Packing
- Faster parameterized algorithm for Bicluster Editing
- Alternative parameterizations for cluster editing
- The biclique partitioning polytope
- On Making Directed Graphs Transitive
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Complexity of modification problems for reciprocal best match graphs
- New heuristics for the bicluster editing problem
- On making directed graphs transitive
- The Multi-parameterized Cluster Editing Problem
- Improved kernelization and fixed-parameter algorithms for bicluster editing
- Complexity of dense bicluster editing problems
- Simpler linear-time kernelization for planar dominating set
- Cograph editing: Merging modules is equivalent to editing P_4s
- A cubic-vertex kernel for flip consensus tree
- Graph-based data clustering with overlaps
- A fast branching algorithm for cluster vertex deletion
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Orthology relations, symbolic ultrametrics, and cographs
- Graph-Based Data Clustering with Overlaps
- Fast biclustering by dual parameterization
- Incremental problems in the parameterized complexity setting
- A survey of the algorithmic aspects of modular decomposition
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
- Fixed-parameter algorithms for cluster vertex deletion
- Branch-and-cut approaches for \(p\)-cluster editing
- Towards optimal and expressive kernelization for \(d\)-hitting set
- Fixed-parameter algorithms for DAG partitioning
- Efficient algorithms for cluster editing
- A parallel hybrid metaheuristic for bicluster editing
- Branch-and-price for \(p\)-cluster editing
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- Applying Modular Decomposition to Parameterized Bicluster Editing
This page was built for publication: Applying modular decomposition to parameterized cluster editing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272201)
