Faster scaling algorithms for general graph matching problems (Q4302856): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q127782667, #quickstatements; #temporary_batch_1722261696779 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127782667 / rank | |||
Normal rank | |||
Latest revision as of 15:09, 29 July 2024
scientific article; zbMATH DE number 622336
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster scaling algorithms for general graph matching problems |
scientific article; zbMATH DE number 622336 |
Statements
Faster scaling algorithms for general graph matching problems (English)
0 references
6 October 1994
0 references
augmenting path
0 references
blossom
0 references
network optimization
0 references
scaling
0 references
minimum-cost matching
0 references
travelling salesman
0 references
linear programming
0 references
