Pages that link to "Item:Q1959397"
From MaRDI portal
The following pages link to Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397):
Displayed 10 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002753) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)