Pages that link to "Item:Q987386"
From MaRDI portal
The following pages link to Fixed-parameter algorithms for cluster vertex deletion (Q987386):
Displayed 12 items.
- On making directed graphs transitive (Q414917) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)