New Approximation Algorithms for Minimum Cycle Bases of Graphs (Q3590960)

From MaRDI portal
Revision as of 21:24, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New Approximation Algorithms for Minimum Cycle Bases of Graphs
scientific article

    Statements

    title
    New Approximation Algorithms for Minimum Cycle Bases of Graphs (English)
    0 references
    author
    Telikepalli Kavitha
    0 references
    Kurt Mehlhorn
    0 references
    Dimitrios Michail
    0 references
    published in
    STACS 2007
    0 references
    publication date
    3 September 2007
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05C38
    0 references
    05C85
    0 references
    zbMATH DE Number
    5186536
    0 references
    OpenAlex ID
    W1902117024
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3590960&oldid=31962675"
    Powered by MediaWiki