Non-strict Temporal Exploration (Q5100955): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The temporal explorer who returns to the base / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exploring always-connected temporal graphs of small pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and offline algorithms for the time-dependent TSP with time zones / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding temporal paths under waiting time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exploration of dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exploration of time-varying networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal graph classes: a view through temporal separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of dynamic networks: tight bounds on the number of agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of Constantly Connected Dynamic Graphs Based on Cactuses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and inference problems for temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causality, influence, and computation in possibly disconnected synchronous dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problems in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Latest revision as of 00:59, 30 July 2024

scientific article; zbMATH DE number 7581063
Language Label Description Also known as
English
Non-strict Temporal Exploration
scientific article; zbMATH DE number 7581063

    Statements

    Non-strict Temporal Exploration (English)
    0 references
    0 references
    0 references
    1 September 2022
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references