Algorithms for Exploring an Unknown Graph
| dc.contributor.advisor | Rivest, Ronald L. | en_US |
| dc.contributor.author | Betke, Margrit | en_US |
| dc.date.accessioned | 2023-03-29T15:18:51Z | |
| dc.date.available | 2023-03-29T15:18:51Z | |
| dc.date.issued | 1992-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149724 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-536 | |
| dc.title | Algorithms for Exploring an Unknown Graph | en_US |
| dc.identifier.oclc | 26707578 |
