Structural Information and Communication Complexity

DOI10.1007/b136628zbMath1085.68106OpenAlexW2480963397MaRDI QIDQ5710079

Kunihiko Sadakane, Jesper Jansson, Wing-Kin Sung, Stefan Dobrev

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (12)

Memory Efficient Anonymous Graph Exploration ⋮ Graph Decomposition for Improving Memoryless Periodic Exploration ⋮ 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 ⋮ On the Power of Local Orientations ⋮ Graph decomposition for memoryless periodic exploration ⋮ 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 ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs

This page was built for publication: Structural Information and Communication Complexity