On packing shortest cycles in graphs (Q989491)

From MaRDI portal
Revision as of 03:20, 3 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
On packing shortest cycles in graphs
scientific article

    Statements

    title
    On packing shortest cycles in graphs (English)
    0 references
    author
    Dieter Rautenbach
    0 references
    Friedrich Regen
    0 references
    publication date
    20 August 2010
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C38
    0 references
    68W25
    0 references
    zbMATH DE Number
    5773804
    0 references
    zbMATH Keywords
    algorithms
    0 references
    approximation algorithms
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references
    shortest cycles
    0 references
    packing
    0 references
    complexity
    0 references
    OpenAlex ID
    W2159067821
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q989491&oldid=35183368"
    Powered by MediaWiki