Pages that link to "Item:Q2407948"
From MaRDI portal
The following pages link to On the complexity of multi-parameterized cluster editing (Q2407948):
Displaying 13 items.
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- Tight bounds for parameterized complexity of Cluster Editing (Q2957869) (← links)
- A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897563) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- \((1,1)\)-cluster editing is polynomial-time solvable (Q6048436) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)