Search results for: PIECEMEAL EXPLORATION

• Brief Announcement: Energy Constrained Depth First Search

  Publication

  • D. Shantanu
  • D. Dereniowski
  • P. Uznański

  - Year 2018

  Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...

  Full text to download in external service