Solving large-scale matching problems efficiently: A new primal matching approach (Q3786301): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230160102 / rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230160102 / rank | |||
Normal rank | |||
Latest revision as of 18:39, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large-scale matching problems efficiently: A new primal matching approach |
scientific article |
Statements
Solving large-scale matching problems efficiently: A new primal matching approach (English)
0 references
1986
0 references
minimum-cost-perfect-matching problem
0 references
weighted matching
0 references
large dense graphs
0 references
two-phase approach
0 references
