![]() |
@article{DBLP:journals/ipl/KishoreS00,
author = {K. V. R. C. N. Kishore and
Sanjeev Saxena},
title = {An optimal parallel algorithm for general maximal matchings
is as easy as for bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {75},
number = {4},
year = {2000},
pages = {145-151},
ee = {http://dx.doi.org/10.1016/S0020-0190(00)00101-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-11-20 by Michael Ley (ley@uni-trier.de)