A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (Q3613764)

From MaRDI portal
Revision as of 01:30, 20 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
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
scientific article

    Statements

    title
    A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (English)
    0 references
    author
    Ramesh Hariharan
    0 references
    Telikepalli Kavitha
    0 references
    Kurt Mehlhorn
    0 references
    publication date
    12 March 2009
    0 references
    zbMATH Keywords
    minimum cycle basis
    0 references
    directed graph
    0 references

    Identifiers

    DOI
    10.1007/11786986_23
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C20
    0 references
    05C38
    0 references
    68W05
    0 references
    68W20
    0 references
    zbMATH DE Number
    5528726
    0 references
    OpenAlex ID
    W2129660997
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3613764&oldid=32800175"
    Powered by MediaWiki