Paper by Erik D. Demaine

Reference:

Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, and Stephen G. Kobourov, “Tight Bounds on Maximal and Maximum Matchings”, Discrete Mathematics, volume 285, number 1–3, August 2004, pages 7–15.

BibTeX

@Article{MatchingBounds_DM,
  AUTHOR        = {Therese Biedl and Erik D. Demaine and Christian A. Duncan
                   and Rudolf Fleischer and Stephen G. Kobourov},
  TITLE         = {Tight Bounds on Maximal and Maximum Matchings},
  JOURNAL       = {Discrete Mathematics},
  journalurl    = {http://www.elsevier.com/locate/disc},
  VOLUME        = 285,
  NUMBER        = {1--3},
  PAGES         = {7--15},
  MONTH         = {August},
  YEAR          = 2004,

  doi           = {https://dx.doi.org/10.1016/J.DISC.2004.05.003},
  dblp          = {https://dblp.org/rec/journals/dm/BiedlDDFK04},
  comments      = {This paper is also available from
                   <A HREF="http://dx.doi.org/10.1016/j.disc.2004.05.003">ScienceDirect</A>.},
  papers        = {MatchingBounds_ISAAC2001},
  replaces      = {MatchingBounds_ISAAC2001},
}

Comments:

This paper is also available from ScienceDirect.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

MatchingBounds_ISAAC2001 (Tight Bounds on Maximal and Maximum Matchings)