K. V. R. C. N. Kishore

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

2000

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)

	2000
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)

Coauthor Index

1 Sanjeev Saxena [1]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page