Tight bounds on maximal and maximum matchings

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we study bounds on maximal and maximum matchings in special graph classes, speci.cally 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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages308-319
Number of pages12
Volume2223 LNCS
DOIs
StatePublished - 2001
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: Dec 19 2001Dec 21 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2223 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
CountryNew Zealand
CityChristchurch
Period12/19/0112/21/01

Fingerprint

Maximum Matching
Graph in graph theory
Graph Classes
Maximum Degree
Lower bound
Class

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Biedl, T., Demaine, E. D., Duncan, C. A., Fleischer, R., & Kobourov, S. G. (2001). Tight bounds on maximal and maximum matchings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2223 LNCS, pp. 308-319). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_27

Tight bounds on maximal and maximum matchings. / Biedl, Therese; Demaine, Erik D.; Duncan, Christian A.; Fleischer, Rudolf; Kobourov, Stephen G.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2223 LNCS 2001. p. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Biedl, T, Demaine, ED, Duncan, CA, Fleischer, R & Kobourov, SG 2001, Tight bounds on maximal and maximum matchings. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2223 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2223 LNCS, pp. 308-319, 12th International Symposium on Algorithms and Computation, ISAAC 2001, Christchurch, New Zealand, 12/19/01. https://doi.org/10.1007/3-540-45678-3_27
Biedl T, Demaine ED, Duncan CA, Fleischer R, Kobourov SG. Tight bounds on maximal and maximum matchings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2223 LNCS. 2001. p. 308-319. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45678-3_27
Biedl, Therese ; Demaine, Erik D. ; Duncan, Christian A. ; Fleischer, Rudolf ; Kobourov, Stephen G. / Tight bounds on maximal and maximum matchings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2223 LNCS 2001. pp. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bf6951feacb84aaaa19ff20ce942ed5d,
title = "Tight bounds on maximal and maximum matchings",
abstract = "In this paper, we study bounds on maximal and maximum matchings in special graph classes, speci.cally 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.",
author = "Therese Biedl and Demaine, {Erik D.} and Duncan, {Christian A.} and Rudolf Fleischer and Kobourov, {Stephen G}",
year = "2001",
doi = "10.1007/3-540-45678-3_27",
language = "English (US)",
isbn = "3540429859",
volume = "2223 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "308--319",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Tight bounds on maximal and maximum matchings

AU - Biedl, Therese

AU - Demaine, Erik D.

AU - Duncan, Christian A.

AU - Fleischer, Rudolf

AU - Kobourov, Stephen G

PY - 2001

Y1 - 2001

N2 - In this paper, we study bounds on maximal and maximum matchings in special graph classes, speci.cally 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.

AB - In this paper, we study bounds on maximal and maximum matchings in special graph classes, speci.cally 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.

UR - http://www.scopus.com/inward/record.url?scp=23044530598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23044530598&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_27

DO - 10.1007/3-540-45678-3_27

M3 - Conference contribution

AN - SCOPUS:23044530598

SN - 3540429859

SN - 9783540429852

VL - 2223 LNCS

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

SP - 308

EP - 319

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

ER -