A cubic-vertex kernel for flip consensus tree
From MaRDI portal
Recommendations
Cites work
- A 2k kernel for the cluster editing problem
- A general method to speed up fixed-parameter-tractable algorithms
- A more relaxed model for graph-based data clustering: s-plex cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- Complexity classification of some edge modification problems
- Computing the Minimum Fill-In is NP-Complete
- Efficient algorithms for inferring evolutionary trees
- Efficient Parameterized Preprocessing for Cluster Editing
- Graph-based data clustering with overlaps
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved fixed-parameter algorithms for minimum-flip consensus trees
- Incomplete Directed Perfect Phylogeny
- Kernelization: new upper and lower bound techniques
- Kernels: Annotated, Proper and Induced
- NP-completeness results for edge modification problems
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Parametrized complexity theory.
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Polynomial kernels for 3-leaf power graph modification problems
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Two edge modification problems without polynomial kernels
Cited in
(9)- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
- A cubic-vertex kernel for flip consensus tree
- Improved fixed-parameter algorithms for minimum-flip consensus trees
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- A survey of parameterized algorithms and the complexity of edge modification
- An improved kernelization algorithm for trivially perfect editing
- Polynomial kernels for edge modification problems towards block and strictly chordal graphs
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
This page was built for publication: A cubic-vertex kernel for flip consensus tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441594)
