Pages that link to "Item:Q2482113"
From MaRDI portal
The following pages link to Planar graph bipartization in linear time (Q2482113):
Displaying 16 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Linear-time recognition of bipartite graphs plus two edges (Q1868840) (← links)
- Faster graph bipartization (Q2301359) (← links)
- On alliance partitions and bisection width for planar graphs (Q2865020) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Subexponential parameterized odd cycle transversal on planar graphs (Q2957518) (← links)
- Constant Time Generation of Biconnected Rooted Plane Graphs (Q3587341) (← links)
- Edge Bipartization Faster Than 2^k (Q4634410) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
- (Q6068237) (← links)
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388) (← links)