Work

Using Blossoms to Find Maximum Matchings on Graphs ; CU-CS-056-74

Year: 1974

Type: report

Source: CU Scholar (University of Colorado Boulder)

Author: Harold N. Gabow

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2778400415

Cites:

Cited by:

Related to: 10