Abstract
There is a surprising, at first glance unexpected, difference in (space) complexity between the problems of finding a path from a start node to an end node in a directed graph and of doing so in an undirected graph. In an undirected graph this is easier to solve; in fact, in can be done using a random walk or a universal traversal sequence.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call