On exploring always-connected temporal graphs of small pathwidth (Q1628692)

From MaRDI portal
Revision as of 00:28, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567334, #quickstatements; #temporary_batch_1711055989931)
scientific article
Language Label Description Also known as
English
On exploring always-connected temporal graphs of small pathwidth
scientific article

    Statements

    title
    On exploring always-connected temporal graphs of small pathwidth (English)
    0 references
    author
    Hans L. Bodlaender
    0 references
    Tom C. van der Zanden
    0 references
    publication date
    5 December 2018
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C40
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6989091
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    computational complexity
    0 references
    temporal graphs
    0 references
    graph exploration
    0 references
    pathwidth
    0 references
    OpenAlex ID
    W2898312999
    0 references
    Wikidata QID
    Q59567334
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1628692&oldid=33141279"
    Powered by MediaWiki