| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 1 |       | K. V. R. C. N. Kishore, Sanjeev Saxena: An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. Inf. Process. Lett. 75(4): 145-151 (2000) |
Selection of 1 from 1 records - K. V. R. C. N. Kishore has 1 coauthors
Last update 2012-02-16 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page