Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. Tight Bounds on Maximal and Maximum Matchings. In Peter Eades, Tadao Takaoka, editors, Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Volume 2223 of Lecture Notes in Computer Science, pages 308-319, Springer, 2001. [doi]
@inproceedings{BiedlDDFK01,
title = {Tight Bounds on Maximal and Maximum Matchings},
author = {Therese C. Biedl and Erik D. Demaine and Christian A. Duncan and Rudolf Fleischer and Stephen G. Kobourov},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2223/22230308.htm},
tags = {C++},
researchr = {https://researchr.org/publication/BiedlDDFK01},
cites = {0},
citedby = {0},
pages = {308-319},
booktitle = {Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
editor = {Peter Eades and Tadao Takaoka},
volume = {2223},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42985-9},
}