The following pages link to Automaten in planaren Graphen (Q1143798):
Displaying 16 items.
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Anonymous graph exploration without collision by mobile robots (Q975538) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- The ANTS problem (Q2401118) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- (Q5075773) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)
