On a Simple Depth-First Search Strategy for Exploring Unknown Graphs

@inproceedings{Kwek1997OnAS,
  title={On a Simple Depth-First Search Strategy for Exploring Unknown Graphs},
  author={Stephen Kwek},
  booktitle={WADS},
  year={1997}
}
We present a simple depth-rst search strategy for exploring (constructing) an unknown strongly connected graph G with m edges and n vertices by traversing at most min(mn; dn 2 + m) edges. Here, d is the minimum number of edges needed to add to G to make it Eulerian. This parameter d is known as the deeciency of a graph and was introduced by Kutten Kut88]. It was conjectured that graphs with low deeciency can be traversed more eeciently than graphs with high deeciency. Deng and Papadimitriou… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
17 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Competitive unidirectional learning. Unpublished Manuscript

  • Bnksp A Bar-Noy, S Kutten, B Scieber, D Peleg
  • Competitive unidirectional learning. Unpublished…
  • 1997

EEcient goal-directed exploration

  • Skvs, Y Smirnov, S Keonig, M Veloso, R Simmons
  • Proceedings of the National Conference on AI
  • 1996

Similar Papers

Loading similar papers…