On exploring always-connected temporal graphs of small pathwidth (Q1628692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2898312999 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59567334 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.11869 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 21:04, 18 April 2024

scientific article
Language Label Description Also known as
English
On exploring always-connected temporal graphs of small pathwidth
scientific article

    Statements

    On exploring always-connected temporal graphs of small pathwidth (English)
    0 references
    0 references
    0 references
    5 December 2018
    0 references
    graph algorithms
    0 references
    computational complexity
    0 references
    temporal graphs
    0 references
    graph exploration
    0 references
    pathwidth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references