Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635)

From MaRDI portal
Revision as of 12:04, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q36943280, #quickstatements; #temporary_batch_1711094041063)
scientific article
Language Label Description Also known as
English
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
scientific article

    Statements

    Packing algorithms for arborescences (and spanning trees) in capacitated graphs (English)
    0 references
    0 references
    0 references
    15 September 1999
    0 references
    covering
    0 references
    Newton's method
    0 references
    capacitated digraphs
    0 references
    packing spanning trees
    0 references
    arborescence packing
    0 references
    laminar family of sets
    0 references

    Identifiers