An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs
Work
Year: 1998
Type: article
Author I. Parfenoff
Institution Université d'Orléans
Cites: 12
Cited by: 7
Related to: 10
FWCI: 0.437
Citation percentile (by year/subfield): 56.47
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed