Join-reachability problems in directed graphs (Q2254502)

From MaRDI portal
Revision as of 15:20, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
Join-reachability problems in directed graphs
No description defined

    Statements

    title
    Join-reachability problems in directed graphs (English)
    0 references
    author
    Loukas Georgiadis
    0 references
    Leonidas Palios
    0 references
    publication date
    5 February 2015
    0 references
    Mathematics Subject Classification ID
    05C20
    0 references
    05C85
    0 references
    05C38
    0 references
    68R10
    0 references
    68P05
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6398311
    0 references
    zbMATH Keywords
    algorithms
    0 references
    data structures
    0 references
    graph algorithms
    0 references
    reachability
    0 references
    combinatorial complexity
    0 references
    OpenAlex ID
    W2019061455
    0 references
    arXiv ID
    1012.4938
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2254502&oldid=34059394"
    Powered by MediaWiki