Pages that link to "Item:Q666655"
From MaRDI portal
The following pages link to Edge bipartization faster than \(2^k\) (Q666655):
Displaying 6 items.
- Linear-time recognition of bipartite graphs plus two edges (Q1868840) (← links)
- Faster graph bipartization (Q2301359) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Obtaining a bipartite graph by contracting few edges (Q2911626) (← links)
- Edge Bipartization Faster Than 2^k (Q4634410) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)