Ranking on arbitrary graphs: rematch via continuous linear programming (Q4581907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ranking on arbitrary graphs: rematch via continuous linear programming |
scientific article; zbMATH DE number 6921486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ranking on arbitrary graphs: rematch via continuous linear programming |
scientific article; zbMATH DE number 6921486 |
Statements
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (English)
0 references
21 August 2018
0 references
oblivious matching problem
0 references
continuous linear programming
0 references
ranking algorithm
0 references
0 references
0.9724791049957277
0 references
0.8461756706237793
0 references
0.8297448754310608
0 references
0.8246445655822754
0 references
0.8185277581214905
0 references
