Experimental studies of graph traversal algorithms

  • Authors:

  • Rudolf Fleischer;Gerhard Trippen

  • Affiliations:

  • Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong

  • Venue:
  • WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We conduct an experimental evaluation of all major online graph traversal algorithms. This includes many simple natural algorithms as well as more sophisticated strategies. The observations we made watching the animated algorithms explore the graphs in the interactive experiments motivated us to introduce some variants of the original algorithms. Since the theoretical bounds for deterministic online algorithms are rather bad and no better bounds for randomized algorithms are known, our work helps to provide a better insight into the practical performance of these algorithms on various graph families. It is to observe that all the tested algorithm have a performance very close to the optimum offline algorithm in a huge family of random graphs. Only few very specific lower bound examples cause bad results.