Pages that link to "Item:Q3031945"
From MaRDI portal
The following pages link to Maximum matchings in general graphs through randomization (Q3031945):
Displayed 9 items.
- Subtree isomorphism is in random NC (Q922707) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) (← links)