Author:
Holloway N. W.,Ravindran S.,Gibbons A. M.
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. E. Dahlhaus and M. Karpinski, “Parallel Construction of Perfect Matching and Hamiltonian Cycles on Dense Graphs”, Theoretical computer science 61 (1988) 121–136
2. J. Edmonds, “Matching and Polyhedrons with 0,1 Vertices”, Journal of Research of the National Bureau of Standards B, 125–130 (1965).
3. J. Edmonds, “Paths, trees and flowers”, Canadian Journal of Mathematics 17 (1965) 449–67.
4. H.N. Gabow, “Implementations of Algorithm for Maximum Matching on Nonbiparitte Graphs”, Ph.D. Dissertation, Dept. of Computer Science, Stanford University, 1974.
5. D.Y. Grigoriev and M. Karpinski, “The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC”, Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (1987), 166–172.