Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/140984051 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2886153187 / rank | |||
Normal rank | |||
Revision as of 00:40, 20 March 2024
scientific article; zbMATH DE number 6921486
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
