Efficient Algorithms for Petersen's Matching Theorem

Journal of Algorithms

Volumn 38, Issue 1, 2001, Pages 110-134

  Biedl, Therese C ^a   Bose, Prosenjit ^b   Demaine, Erik D ^a   Lubiw, Anna ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

3 regular graphs; Perfect matching; Petersen's theorem

Indexed keywords

EID: 0347122395     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1132     Document Type: Article

References (47)

1. D. J. Allman, A quadrilateral finite element including vertex rotation for plane elasticity analysis, Int. J. Numer. Methods Eng. 26 (1988), 717-730.
2. Marshall Bern and David Eppstein, Mesh generation and optimal triangulation, in "Computing in Euclidean Geometry," 2nd ed., pp. 23-90, World Scientific, Singapore, 1992.
3. Norman L. Biggs, Keith E. Lloyd, and Robin J. Wilson, "Graph Theory 1735-1936," Clarendon, Oxford, 1986.
4. Prosenjit Bose, David Kirkpatrick, and Zaiqing Li, Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain, in "Proceedings of the 8th Canadian Conference on Computational Geometry," (F. Fiala, E. Kranakis, and J.-R. Sack, Eds.), International Informatics Series, Vol. 5, pp. 217-222, Carleton Univ. Press, Ottawa, 1996.
5. Prosenjit Bose, Thomas Shermer, Godfried Toussaint, and Binhai Zhu, Guarding polyhedral terrains, Comput. Geom. Theory Appl. 7, No. 3 (1997), 173-195.
6. John Boyer and Wendy Myrvold, Stop minding your P's and Q's: A simplified O(n) planar embedding algorithm, in "Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, January 1999," pp. 140-146.
7. H. R. Brahana, A proof of Petersen's theorem, Ann. Math. Ser. 2 19 (1917-1918), 59-63.
8. Gary Chartrand, Donald L. Goldsmith, and Seymour Schuster, A sufficient condition for graphs with 1-factors, Colloq. Math. 41, No. 2 (1979), 339-344.
9. Gary Chartrand and L. Nebeský, A note on 1-factors in graphs, Period. Math. Hung. 10, No. 1 (1979), 41-46.
10. Richard Cole and Micha Sharir, Visibility problems for polyhedral terrains, J. Symbol. Comput. 7, No. 1 (1989), 11-30.
11. Jack Edmonds, Paths, trees, and flowers, Can. J. Math. 17 (1965), 449-467.
12. David Eppstein, Zvi Galil, Giuseppe F. Italiano, and Amnon Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, J. Assoc. Comput. Math. 44, No. 5 (1997), 669-696.
13. Alfred Errera, Une demonstration du théorème de Petersen, Mathesis, 36 (1922), 56-61.
14. Hazel Everett and Eduardo Rivera-Campo, Edge guarding polyhedral terrains, Comput. Geom. Theory Appl. 7, No. 3 (1997), 201-203.
15. Leila De Floriani, Bianca Falcidieno, Caterina Pienovi, David Allen, and George Nagy, A visibility-based model for terrain features, in "Proceedings of the 2nd International Symposium on Spatial Data Handling, Seattle, WA, 1986," pp. 235-250.
16. Orrin Frink, Jr., A proof of Petersen's theorem, Ann. Math. Ser. 2 27 (1925-1926), 491-493.
17. Harold N. Gabow, Haim Kaplan, and Robert E. Tarjan, Unique maximum matching algorithms, in "Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999," pp. 70-78.
18. Harold N. Gabow and Robert E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1985), 209-221.
19. Michael F. Goodchild and Jay Lee, Coverage problems and visibility regions on topographic surfaces, Ann. Oper. Res. 18 (1989), 175-186.
20. Pierre Hansen and Mao Lin Zheng, A linear algorithm for perfect matching in hexagonal systems, Discrete Math. 122, Nos. 1-3 (1993), 179-196.
21. Monika Rauch Henzinger and Valerie King, "Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation," Technical Note 1997-004a, Digital SRC, June 1997. (A preliminary version appeared in "Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, 1995," pp. 519-527)
22. Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup, Poly-logarithmic deterministic fully-dynamic graph algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, in "Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1998," pp. 79-89.
23. John Hopcroft and Robert Tarjan, Efficient planarity testing, J. Assoc. Comput. Mech. 21, No. 4 (1974), 549-568.
24. Claire Kenyon and Eric Rémila, Perfect matchings in the triangular lattice, Discrete Math. 152, Nos. 1-3 (1996), 191-210.
25. Dénes König, "Theorie der endlichen und unendlichen Graphen," Akademische Verlagsgesellschaft, Leipzig, 1936; see also the English translation, "Theory of Finite and Infinite Graphs," Birkhäuser, Boston, 1990.
26. Dénes König, "Theorie der endlichen und unendlichen Graphen," Akademische Verlagsgesellschaft, Leipzig, 1936; see also the English translation, "Theory of Finite and Infinite Graphs," Birkhäuser, Boston, 1990.
27. 2 supersplines of degree six, SIAM J. Numer. Anal. 34, No. 3 (1997), 905-921.
28. Jay Lee, Analyses of visibility sites on topographic surfaces, Int. J. Geograph. Inform. Systems 5, No. 4 (1991), 413-429.
29. László Lovász and M. D. Plummer, "Matching Theory," Akadémiai Kiadó, Budapest/North-Holland, Amsterdam, 1986.
30. K. Mehlhorn and P. Mutzel, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, Algorithmica 16, No. 2 (1996), 233-242.
31. Silvio Micali and Vijay V. Vazirani, An O(√\v\ · \E\) algorithm for finding maximum matching in general graphs, in "Proceedings of the 21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, 1980," pp. 17-27.
32. William F. Mitchell, "Unified Multilevel Adaptive Finite Element Methods for Elliptic Problems," PhD thesis; Technical Report UIUCDCS-R-88-1436, Department of Computer Science, University of Illinois, Urbana, IL, 1988.
33. William F. Mitchell, Adaptive refinement for arbitrary finite-element spaces with hierarchical bases, J. Comput. Appl. Math. 36, No. 1 (1991), 65-78.
34. Takao Nishizeki and Ilker Baybars, Lower bounds on the cardinality of the maximum matchings of planar graphs, Discrete Math. 28, No. 3 (1979), 255-267.
35. Joseph O'Rourke, "Art Gallery Theorems and Algorithms," Oxford Univ. Press, Oxford, 1987.
36. Joseph O'Rourke, Satellite sentries, in "Art Gallery Theorems and Algorithms," Sect. 10.2.4, pp. 257-258, Oxford Univ. Press, Oxford, 1987.
37. Julius Peter Christian Petersen, Die Theorie der regulären Graphs [The theory of regular graphs], Acta Math. 15 (1891), 193-220.
38. Paul A. Peterson and Michael C. Loui, The general maximum matching algorithm of Micali and Vazirani, Algorithmica 3 (1988), 511-533.
39. Ján Plesník, Connectivity of regular graphs and the existence of 1-factors, Mat. Časopis 22, No. 4 (1972), 310-318.
40. Suneeta Ramaswami, Pedro Ramos, and Godfried Toussaint, Converting triangulations to quadrangulations, Comput. Geom. Theory Appl. 9, No. 4 (1998), 257-276.
41. Alexander Schrijver, Bipartite edge-coloring in O(Δm) time, SIAM J. Comput. 28, No. 3 (1999), 841-846.
42. Thomas C. Shermer, Recent results in art galleries, Proc. IEEE 80, No. 9 (1992), 1384-1399.
43. Robert Endre Tarjan, "Data Structures and Network Algorithms," Soc. Industr. Appl. Math., Philadelphia, 1983.
44. William P. Thurston, Conway's tiling groups, Amer. Math. Monthly 97, No. 8 (1990), 757-773.
45. W. T. Tutte, The factorization of linear graphs, J. London Math. Soc. 22 (1947), 107-111.
46. Jorge Urrutia, Art gallery and illumination problems, in "Handbook on Computational Geometry," (J. R. Sack and J. Urrutia, Eds.), Chap. 22, pp. 973-1027. Elsevier, Amsterdam, 2000.
47. Vijay V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O(√V E) general graph maximum matching algorithm, Combinatorica 14, No. 1 (1994), 71-109.