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 execution is the …
We present a new algorithm for finding a maximum matching in a general graph. The special feature of our algorithm is that its only computationally non-trivial step is the inversion of a …
K MULMULEY, UV VAZIRANI… - Combinatorica …, 1987 - pascal-francis.inist.fr
Matching is as easy as matrix inversion CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search by classification …
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 execution is the …
Matching is as easy as matrix inversion | Combinatorica skip to main content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …
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 execution is the …
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 execution is the …