Pages that link to "Item:Q1759680"
From MaRDI portal
The following pages link to Cluster editing: kernelization based on edge cuts (Q1759680):
Displaying 24 items.
- Approximate association via dissociation (Q505447) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Sufficient conditions for edit-optimal clusters (Q903364) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Cluster Editing (Q5326357) (← links)
- (Q5874544) (← links)
- \((1,1)\)-cluster editing is polynomial-time solvable (Q6048436) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
