Exploration of dynamic cactuses with sub-logarithmic overhead (Q2035475): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-020-10001-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3049358372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs / 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: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patrolling on dynamic ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exploration of dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering in dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Information Spreading in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on distributed exploration of temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of dynamic tori by multiple 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: Distributed computation in dynamic 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: Traveling salesman problems in temporal graphs / rank
 
Normal rank

Latest revision as of 02:19, 26 July 2024

scientific article
Language Label Description Also known as
English
Exploration of dynamic cactuses with sub-logarithmic overhead
scientific article

    Statements

    Exploration of dynamic cactuses with sub-logarithmic overhead (English)
    0 references
    0 references
    0 references
    24 June 2021
    0 references
    0 references
    exploration
    0 references
    dynamic graphs
    0 references
    mobile agent
    0 references
    connectivity over time
    0 references
    0 references