Tight bounds on maximal and maximum matchings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 308-319

  Biedl, Therese ^a   Demaine, Erik D ^a   Duncan, Christian A ^b   Fleischer, Rudolf ^c   Kobourov, Stephen G ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Department of Computer Science and Center for Computational Science   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; MATCHINGS; MAXIMUM DEGREE; MAXIMUM MATCHINGS; SPECIAL GRAPH CLASS; TIGHT BOUND;

CONTROL THEORY; IMAGE RETRIEVAL; COMPUTERS;

COMPUTATION THEORY; ARTIFICIAL INTELLIGENCE;

EID: 23044530598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_27     Document Type: Conference Paper

References (15)

1. C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U. S. A., 43:842-844, 1957. 311
2. T. Biedl, P. Bose, E. Demaine, and A. Lubiw. Efficient algorithms for Petersen's theorem. J. Algorithms, 38:110-134, 2001. 308
3. J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.
4. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. Technical Report TR1999-792, Department of Computer Science, New York University, September 1999. 308
5. C. Duncan, M. Goodrich, and S. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In Graph Drawing (GD'99), volume 1731 of Lecture Notes in Computer Science, pages 186-196. Springer-Verlag, 1999.
6. Accepted for publication in Computational Geometry: Theory and Applications. 308, 311
7. P. Hall. On representation of subsets. Journal of the London Mathematical Society, 10:26-30, 1935. 308
8. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973. 308
9. G. Kant. A more compact visibility representation. Internat. J. Comput. Geom. Appl., 7(3):197-210, 1997. 310, 312
10. D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77:453-465, 1916. 308
11. 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. Institute of Electrical and Electronics Engineers Inc. (IEEE). 308
12. J. Petersen. Die Theorie der regulären graphs (The theory of regular graphs). Acta Mathematica, 15:193-220, 1891. 308, 309
13. A. Schrijver. Bipartite edge coloring in O(Δ m)time. SIAM J. Comput., 28(3):841-846, 1999. 308
14. W. T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107-111, 1947. 308, 311
15. W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99-116, 1956. 309