On the Complexity of Finding a Minimum Cycle Cover of a Graph (Q4337653)

From MaRDI portal
Revision as of 07:56, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1012890
Language Label Description Also known as
English
On the Complexity of Finding a Minimum Cycle Cover of a Graph
scientific article; zbMATH DE number 1012890

    Statements

    On the Complexity of Finding a Minimum Cycle Cover of a Graph (English)
    0 references
    0 references
    26 May 1997
    0 references
    complexity
    0 references
    minimum cycle cover
    0 references

    Identifiers