Matching is as easy as matrix inversion
A new algorithm for finding a maximum matching in a general graph is presented; its special feature being that the only computationally non-trivial step required in its executio...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 617
- Institution
- University of California, Berkeley
External Links
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.