An exact performance bound for an $O(m+n)$ time greedy matching procedure.

Shapira, Andrew. "An exact performance bound for an time greedy matching procedure.." The Electronic Journal of Combinatorics [electronic only] 4.1 (1997): Research paper R25, 15 p.-Research paper R25, 15 p.. <http://eudml.org/doc/119263>.

@article{Shapira1997,
author = {Shapira, Andrew},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {extremal problems; bound; greedy matching procedure; extremal function; maximum matching; augmenting path algorithms},
language = {eng},
number = {1},
pages = {Research paper R25, 15 p.-Research paper R25, 15 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {An exact performance bound for an time greedy matching procedure.},
url = {http://eudml.org/doc/119263},
volume = {4},
year = {1997},
}

TY - JOUR
AU - Shapira, Andrew
TI - An exact performance bound for an time greedy matching procedure.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1997
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 4
IS - 1
SP - Research paper R25, 15 p.
EP - Research paper R25, 15 p.
LA - eng
KW - extremal problems; bound; greedy matching procedure; extremal function; maximum matching; augmenting path algorithms
UR - http://eudml.org/doc/119263
ER -