Packing cycles exactly in polynomial time (Q421271)

From MaRDI portal
Revision as of 07:07, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Packing cycles exactly in polynomial time
scientific article

    Statements

    Packing cycles exactly in polynomial time (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    0 references
    packing and covering
    0 references
    polynomial algorithm
    0 references
    min-max relation
    0 references
    maximum cycle packing
    0 references
    0 references