Reachability in graph timelines (Q2986875)

From MaRDI portal
Revision as of 20:31, 13 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
Reachability in graph timelines
scientific article

    Statements

    title
    Reachability in graph timelines (English)
    0 references
    author
    Jakub Łącki
    0 references
    Piotr Sankowski
    0 references
    publication date
    16 May 2017
    0 references
    zbMATH Keywords
    dynamic graph algorithms
    0 references
    graph timeline
    0 references
    reachability
    0 references
    transitive closure
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P05
    0 references
    05C85
    0 references
    68R10
    0 references
    68W20
    0 references
    zbMATH DE Number
    6718194
    0 references
    OpenAlex ID
    W2019301863
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2986875&oldid=36321836"
    Powered by MediaWiki