An O (N2.5) algorithm for maximum matching in general graphs
Year: 1975
Type: conference-paper
DOI: 10.1109/sfcs.1975.5
Institution: Weizmann Institute of Science
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2065295938
