Worst-case greedy matchings in the unitd-cube (Q3204344): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/net.3230200607 / 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
Property / DOI
 
Property / DOI: 10.1002/NET.3230200607 / rank
 
Normal rank

Latest revision as of 22:13, 20 December 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
    0 references
    0 references
    0 references
    1990
    0 references
    worst-case behavior of greedy matchings
    0 references
    asymptotic growth rate of the weight
    0 references

    Identifiers