Linear reductions of maximum matching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 825-826

  Biedl, Therese ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 58449105166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. T. Biedl. Linear reductions of maximum matching. Technical Report CS-2000-17, Dept. of Computer Science, University of Waterloo, October 2000.
2. Therese C. Biedl , Prosenjit Bose , Erik D. Demaine , Anna Lubiw, Efficient algorithms for Petersen's matching theorem, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.130-139, January 17-19, 1999, Baltimore, Maryland, United States
3. R. Cole , K. Ost , S. Schirra, Edge-Coloring Bipartite Multigraphs in $0(E\log D)$ Time, New York University, New York, NY, 1999
4. Pierre Hansen , Maolin Zheng, A linear algorithm for perfect matching in hexagonal systems, Discrete Mathematics, v.122 n.1-3, p.179-196, Nov. 15, 1993 [doi〉10.1016/0012-365X(93)90294-4]
5. John E. Hopcrofi and Richard M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SlAM J. Comput., 2:225-231, 1973.
6. Claire Kenyon , Eric Rémila, Perfect matchings in the triangular lattice, Discrete Mathematics, v.152 n.1-3, p.191-210, May 20, 1996 [doi〉10.1016/0012-365X(94) 00304-2]
7. L. Lovfisz and M. D. Plummer. Matching theory. North- Holland Publishing Co., Amsterdam, 1986.
8. S. Micali and V. V. Vazirani. An O(|V| . |E|) algorithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science, pages 17-27, New York, 1980.
9. J. Petersen. Die Theorie der regularen graphs (The theory of regular graphs). Acta Mathematica, 15:193-220, 1891.
10. C. P. Schnorr, Satisfiability Is Quasilinear Complete in NQL, Journal of the ACM (JACM), v.25 n.1, p.136-145, Jan. 1978 [doi〉10.1145/322047.322060]
11. Alexander Schrijver, Bipartite Edge Coloring in $O(\Delta m)$ Time, SIAM Journal on Computing, v.28 n.3, p.841-846, Feb. 1999 [doi〉10.1137/S0097539796299266]
12. William P. Thurston, Conway's tiling groups, American Mathematical Monthly, v.97 n.8, p.757-756, Oct. 1990 [doi〉10.2307/2324578]