Exploration of dynamic networks: tight bounds on the number of agents (Q2229946): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label-guided graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Exploration by Silent and Oblivious Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of High-Dimensional Grids by Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of memory size on graph exploration capability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring Temporal Lags in Delay-Tolerant Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for black holes in subways / 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: Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Dissemination in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated consensus in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gracefully degrading gathering in dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering in dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problems in temporal graphs / 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: Q5092344 / 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: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing robots in highly dynamic environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exploration of dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms For Unidirectional Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of the rotor-router mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Traversal of Labyrinths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does adding more agents make a difference? A case study of cover time for the rotor-router / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed ant algorithm for efficiently patrolling a network / rank
 
Normal rank

Latest revision as of 15:00, 26 July 2024

scientific article
Language Label Description Also known as
English
Exploration of dynamic networks: tight bounds on the number of agents
scientific article

    Statements

    Exploration of dynamic networks: tight bounds on the number of agents (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2021
    0 references
    distributed algorithm
    0 references
    mobile agents
    0 references
    exploration of dynamic networks
    0 references
    arbitrary footprint
    0 references
    0 references
    0 references
    0 references

    Identifiers