Pages that link to "Item:Q2867127"
From MaRDI portal
The following pages link to The Multi-parameterized Cluster Editing Problem (Q2867127):
Displaying 11 items.
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Tight bounds for parameterized complexity of Cluster Editing (Q2957869) (← links)
- A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897563) (← links)
- Efficient algorithms for cluster editing (Q5963626) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)