Pages that link to "Item:Q4981153"
From MaRDI portal
The following pages link to A Fast Branching Algorithm for Cluster Vertex Deletion (Q4981153):
Displaying 5 items.
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
