Pages that link to "Item:Q2268862"
From MaRDI portal
The following pages link to Iterative compression and exact algorithms (Q2268862):
Displayed 9 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Algorithms for deletion problems on split graphs (Q2656339) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)