Pages that link to "Item:Q2268862"
From MaRDI portal
The following pages link to Iterative compression and exact algorithms (Q2268862):
Displaying 17 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)
- Iterative polynomial interpolation and data compression (Q1315197) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Algorithms for deletion problems on split graphs (Q2656339) (← links)
- Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5092393) (← links)
- (Q5283997) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← links)
