@dblp

Matching Algorithms Are Fast in Sparse Random Graphs.

, , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 81-92. Springer, (2004)

Links and resources

URL:
BibTeX key:
conf/stacs/BastMST04
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication