An exact performance bound for an O(m+n) time greedy matching procedure.
Shapira, Andrew
The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1997-01-01
EUDML-ID : urn:eudml:doc:119263 
@article{01118015,
     title = {An exact performance bound for an },
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {4},
     year = {1997},
     zbl = {0885.05092},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01118015}
}

Shapira, Andrew. An exact performance bound for an . The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997) . http://gdmltest.u-ga.fr/item/01118015/