Packing cuts in undirected graphs (Q4812395)

From MaRDI portal
Revision as of 02:28, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 2093900
Language Label Description Also known as
English
Packing cuts in undirected graphs
scientific article; zbMATH DE number 2093900

    Statements

    Packing cuts in undirected graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2004
    0 references
    packing
    0 references
    edge-disjoint cuts
    0 references
    independent set
    0 references
    complexity
    0 references
    approximation
    0 references
    linear programming relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references