Work

An O (N2.5) algorithm for maximum matching in general graphs

FWCI: 5.389
Cites: 8
Cited by: 338
Related to: 9