Structural Information and Communication Complexity

DOI10.1007/b136628zbMath1085.68106MaRDI 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

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68R10: Graph theory (including graph drawing) in computer science

68T40: Artificial intelligence for robotics

Related Items

Exploration of Time-Varying Connected Graphs with Silent Agents, Memory Efficient Anonymous Graph Exploration, Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles, 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, Graph decomposition for memoryless periodic exploration, Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?, Graph Decomposition for Improving Memoryless Periodic Exploration, More Efficient Periodic Traversal in Anonymous Undirected Graphs, On the Power of Local Orientations