Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3046743058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with logarithmic memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sense of direction in distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast periodic graph exploration with constant memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Efficient Anonymous Graph Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting port numbers for fast graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition for memoryless periodic exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exploration of dynamic rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaten in planaren Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Local Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correctness proof of a topology information maintenance protocol for a distributed computer network / 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 00:59, 30 July 2024

scientific article; zbMATH DE number 7581064
Language Label Description Also known as
English
Exploration of Time-Varying Connected Graphs with Silent Agents
scientific article; zbMATH DE number 7581064

    Statements

    Exploration of Time-Varying Connected Graphs with Silent Agents (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2022
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references