Pages that link to "Item:Q439936"
From MaRDI portal
The following pages link to Space complexity of perfect matching in bounded genus bipartite graphs (Q439936):
Displayed 5 items.
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)