Setting port numbers for fast graph exploration

DOI10.1016/J.TCS.2008.03.035MaRDI QIDQ935169zbMATH OpenOpenAlexFDO

Authors David Ilcinkas

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

zbMATH Keywords

finite automatongraph explorationperiodic exploration

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Setting Port Numbers for Fast Graph Exploration
• Implementing efficient graphs in connection networks
• Algorithms – ESA 2005
• Fast collaborative graph exploration
• Fast collaborative graph exploration
• Fast edge-routing for large graphs
• Publication:3783230
• Low-congestion shortcut and graph parameters
• Low-congestion shortcut and graph parameters
• Routing number of dense and expanding graphs

Cites work

• scientific article; zbMATH DE number 194193 (Why is no real title available?)
• Algorithms – ESA 2005
• Automata and Labyrinths
• Automata, Languages and Programming
• Automaten in planaren Graphen
• Distributed Algorithms For Unidirectional Networks
• Exploring Unknown Environments
• Exploring Unknown Undirected Graphs
• Exploring an unknown graph
• Interval routing schemes allow broadcasting with linear message-complexity
• LATIN 2004: Theoretical Informatics
• Mathematical Foundations of Computer Science 2004
• Optimal constrained graph exploration
• Reverse search for enumeration
• STACS 2004
• Sense of direction in distributed computing
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity
• The power of a pebble: Exploring and mapping directed graphs
• Tree exploration with little memory
• Undirected ST-connectivity in log-space

Cited in

(15)

• More efficient periodic traversal in anonymous undirected graphs
• More agents may decrease global work: a case in butterfly decontamination
• Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
• Graph decomposition for memoryless periodic exploration
• Graph Decomposition for Improving Memoryless Periodic Exploration
• Connected reconfiguration of lattice-based cellular structures by finite-memory robots
• LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
• Setting Port Numbers for Fast Graph Exploration
• Fast Periodic Graph Exploration with Constant Memory
• Setting ports in an anonymous network: how to reduce the level of symmetry?
• On the Power of Local Orientations
• 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
• Fast periodic graph exploration with constant memory
• More efficient periodic traversal in anonymous undirected graphs

This page was built for publication: Setting port numbers for fast graph exploration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935169)