Setting Port Numbers for Fast Graph Exploration

DOI10.1007/11780823_6MaRDI QIDQ3613644zbMATH OpenOpenAlexFDO

Authors David Ilcinkas

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Setting port numbers for fast graph exploration
• Fast periodic graph exploration with constant memory
• Fast Periodic Graph Exploration with Constant Memory
• More efficient periodic traversal in anonymous undirected graphs
• More efficient periodic traversal in anonymous undirected graphs

Cited in

(8)

• Memory Efficient Anonymous Graph Exploration
• Fast periodic graph exploration with constant memory
• More efficient periodic traversal in anonymous undirected graphs
• More efficient periodic traversal in anonymous undirected graphs
• Fast Periodic Graph Exploration with Constant Memory
• Setting port numbers for fast graph exploration
• Anonymous graph exploration without collision by mobile robots
• On the Power of Local Orientations

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 Q3613644)