Tight Bounds on Maximal and Maximum Matchings

Authors:
Therese C. Biedl;Erik D. Demaine;Christian A. Duncan;Rudolf Fleischer;Stephen G. Kobourov
Affiliations:
-;-;-;-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 5
Cited 0

Bipartite Edge Coloring in $O(\Delta m)$ Time

SIAM Journal on Computing
Efficient algorithms for Petersen's matching theorem

Journal of Algorithms
Edge-Coloring Bipartite Multigraphs in $0(E\log D)$ Time

Edge-Coloring Bipartite Multigraphs in $0(E\'log D)$ Time
Graph Theory With Applications

Graph Theory With Applications
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

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.