Online graph exploration: New results on old and new algorithms
- 1 December 2012
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 463, 62-72
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Online algorithms for searching and exploration in the planeComputer Science Review, 2010
- Weighted nearest neighbor algorithms for the graph exploration problem on cyclesInformation Processing Letters, 2010
- The Online Graph Exploration Problem on Restricted GraphsIEICE Transactions on Information and Systems, 2009
- Impact of memory size on graph exploration capabilityDiscrete Applied Mathematics, 2008
- Collective tree explorationNetworks, 2006
- Optimal constrained graph explorationACM Transactions on Algorithms, 2006
- Optimal graph exploration without good mapsTheoretical Computer Science, 2004
- Algorithms for the On-Line Travelling Salesman1Algorithmica, 2001
- Exploring Unknown Undirected GraphsJournal of Algorithms, 1999
- Constructing competitive tours from local informationTheoretical Computer Science, 1994