In this paper we present algorithms that compute large matchings in planar graphs with fixed minimum degree. The algorithms give a guarantee on the size of the computed matching and run in linear time. Thus they are faster than the best known algorithm for computing maximum matchings in general graphs and in planar graphs, which run in and O(n 1.188) time, respectively. For the class of planar graphs with minimum degree 3 the bounds we achieve are known to be best possible. Further, we discuss how minimum degree 5 can be used to obtain stronger bounds on the matching size. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Franke, R., Rutter, I., & Wagner, D. (2009). Computing large matchings in planar graphs with fixed minimum degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 872–881). https://doi.org/10.1007/978-3-642-10631-6_88
Mendeley helps you to discover research relevant for your work.