Pages that link to "Item:Q2453563"
From MaRDI portal
The following pages link to Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563):
Displaying 29 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5075776) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
