Skip to main content
Article thumbnail
Location of Repository

Tight bounds on maximal and maximum matchings

By Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer and Stephen G. Kobourov

Abstract

Abstract. In this paper, we study bounds on maximal and maximum matchings in special graph classes, specifically triangulated graphs and graphs with bounded maximum degree. For each class, we give a lower bound on the size of matchings, and prove that it is tight for some graph within the class. 1 Introduction The problem of finding a maximum matching in a graph has a long and dis-tinguished history beginning with the early work of Petersen [10], K"onig [8], Hall [5], and Tutte [12]. The fastest algorithms to find a maximum matching inan n-vertex m-edge graph takes O(pnm) time, for bipartite graphs [6] as wellas for general graphs [9]

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6321
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.arizona.edu/~kob... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.