Optimal Graph Exploration without Good Maps

Anders Dessmark, Andrzej Pelc. Optimal Graph Exploration without Good Maps. In Rolf H. Möhring, Rajeev Raman, editors, Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings. Volume 2461 of Lecture Notes in Computer Science, pages 374-386, Springer, 2002. [doi]

@inproceedings{DessmarkP02,
  title = {Optimal Graph Exploration without Good Maps},
  author = {Anders Dessmark and Andrzej Pelc},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2461/24610374.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/DessmarkP02},
  cites = {0},
  citedby = {0},
  pages = {374-386},
  booktitle = {Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings},
  editor = {Rolf H. Möhring and Rajeev Raman},
  volume = {2461},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44180-8},
}