Browsing Computer Science and Automation (CSA) by Subject "Graph Covering Problems"
Now showing items 1-1 of 1
-
Algorithms and lower bounds for graph connectivity and covering
Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ...

