"Matching Algorithms Are Fast in Sparse Random Graphs."

Hannah Bast et al. (2004)

Details and statistics

DOI: 10.1007/978-3-540-24749-4_8

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics