LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
From MaRDI portal
Publication:4902885
Cites Work
- Automaten in planaren Graphen
- Fast periodic graph exploration with constant memory
- Graph exploration by a finite automaton
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Setting port numbers for fast graph exploration
- The power of a pebble: Exploring and mapping directed graphs
- Tree exploration with advice
- Tree exploration with little memory
This page was built for publication: LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902885)