We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Algorithms for Exploring an Unknown Graph

Thumbnail Image
Download
Name

MIT-LCS-TR-536.pdf

Size

2.1 MB

Format

Adobe PDF

Checksum (MD5)

050aa6fbd43b43f5ba84a60921a81593

Author(s)
Betke, Margrit
Advisor(s)
Rivest, Ronald L.
Date Issued
March 1992
Series/Report no.
MIT-LCS-TR-536
Abstract
We consider the problem of exploring an unknown strongly connected directed graph. We use the exploration model introduced by Deng and Papadimitriou [DP90]. An explorer follows the edges of an unknown graph until she has seen all the edges and vertices of the graph.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.