Faster Algorithms for Minimum Cycle Basis in Directed Graphs (Q3395038)

From MaRDI portal
Revision as of 22:53, 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
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
scientific article

    Statements

    title
    Faster Algorithms for Minimum Cycle Basis in Directed Graphs (English)
    0 references
    DOI
    10.1137/060670730
    0 references
    author
    Ramesh Hariharan
    0 references
    Telikepalli Kavitha
    0 references
    Kurt Mehlhorn
    0 references
    publication date
    20 August 2009
    0 references
    Mathematics Subject Classification ID
    68W20
    0 references
    05C20
    0 references
    68W40
    0 references
    zbMATH DE Number
    5597435
    0 references
    zbMATH Keywords
    cycle basis
    0 references
    fast matrix multiplication
    0 references
    randomization
    0 references
    shortest paths
    0 references
    OpenAlex ID
    W2144071845
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3395038&oldid=32061261"
    Powered by MediaWiki