Pages that link to "Item:Q5444970"
From MaRDI portal
The following pages link to Efficient Parameterized Preprocessing for Cluster Editing (Q5444970):
Displaying 30 items.
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Clustering with partial information (Q2268879) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
- Cluster Editing (Q5326357) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
