Ranking on arbitrary graphs: rematch via continuous LP with monotone and boundary condition constraints (Q5384044)
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 LP with monotone and boundary condition constraints |
scientific article; zbMATH DE number 7069400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ranking on arbitrary graphs: rematch via continuous LP with monotone and boundary condition constraints |
scientific article; zbMATH DE number 7069400 |
Statements
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints (English)
0 references
20 June 2019
0 references
maximum matching
0 references
oblivious algorithms
0 references
primal-dual methods
0 references
continuous linear programming
0 references
0.9724791049957277
0 references
0.8382619619369507
0 references
0.8194789290428162
0 references
0.8134793043136597
0 references
