Pages that link to "Item:Q3656854"
From MaRDI portal
The following pages link to Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854):
Displaying 11 items.
- The cluster deletion problem for cographs (Q394219) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Cluster deletion revisited (Q2234801) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- Cluster Editing (Q5326357) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs (Q6591469) (← links)