Worst-case greedy matchings in the unitd-cube (Q3204344): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230200607 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045021063 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Revision as of 12:29, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case greedy matchings in the unitd-cube |
scientific article |
Statements
Worst-case greedy matchings in the unitd-cube (English)
0 references
1990
0 references
worst-case behavior of greedy matchings
0 references
asymptotic growth rate of the weight
0 references
