Setting port numbers for fast graph exploration
From MaRDI portal
Publication:935169
DOI10.1016/j.tcs.2008.03.035zbMath1147.68042OpenAlexW2115328391MaRDI QIDQ935169
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.035
Related Items (11)
Graph Decomposition for Improving Memoryless Periodic Exploration ⋮ More agents may decrease global work: a case in butterfly decontamination ⋮ Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles ⋮ Graph decomposition for memoryless periodic exploration ⋮ More efficient periodic traversal in anonymous undirected graphs ⋮ LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Automaten in planaren Graphen
- The power of a pebble: Exploring and mapping directed graphs
- Sense of direction in distributed computing
- Reverse search for enumeration
- Undirected ST-connectivity in log-space
- Space Lower Bounds for Maze Threadability on Restricted Machines
- Automata and Labyrinths
- Distributed Algorithms For Unidirectional Networks
- Exploring an unknown graph
- Tree exploration with little memory
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Interval routing schemes allow broadcasting with linear message-complexity
- STACS 2004
- Mathematical Foundations of Computer Science 2004
- Algorithms – ESA 2005
- Structural Information and Communication Complexity
- Structural Information and Communication Complexity
- Automata, Languages and Programming
- LATIN 2004: Theoretical Informatics
This page was built for publication: Setting port numbers for fast graph exploration
