Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Approximate sequencing for variable length tasks
Theoretical Computer Science
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Tree exploration with little memory
Journal of Algorithms
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Optimal graph exploration without good maps
Theoretical Computer Science
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
On the Power of Local Orientations
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Information and Computation
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Robustness of the Rotor-router Mechanism
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal map construction of an unknown torus
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
An agent exploration in unknown undirected graphs with whiteboards
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Journal of Parallel and Distributed Computing
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On the exploration of time-varying networks
Theoretical Computer Science
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Hi-index | 0.01 |
We wish to explore all edges of an unknown directed, strongly connected graph. At each point, we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited, but we cannot tell where each leads until we traverse it. We wish to minimize the ratio of the total number of edges traversed divided by the optimum number of traversals, had we known the graph. For Eulerian graphs, this ratio cannot be better than two, and two is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. Our main result is an algorithm that achieves a bounded ratio when the deficiency is bounded. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 265–297, 1999