The power of team exploration: Two robots can learn unlabeled directed graphs
We show that two cooperating robots can learn exactly any strongly-connected directed
graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new …
graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new …
A sublinear space, polynomial time algorithm for directed st connectivity
G Barnes, JF Buss, WL Ruzzo, B Schieber - SIAM Journal on Computing, 1998 - SIAM
Directed st connectivity is the problem of detecting whether there is a path from vertex s to
vertex t in a directed graph. We present the first known deterministic sublinear space …
vertex t in a directed graph. We present the first known deterministic sublinear space …
Counting quantifiers, successor relations, and logarithmic space
K Etessami - Journal of Computer and System Sciences, 1997 - Elsevier
Given a successor relationS (ie, a directed line graph), and given two distinguished
pointssandt, the problem ORD is to determine whethersprecedestin the unique ordering …
pointssandt, the problem ORD is to determine whethersprecedestin the unique ordering …
Tight Lower Bounds for st-Connectivity on the NNJAG Model
J Edmonds, CK Poon, D Achlioptas - SIAM Journal on Computing, 1999 - SIAM
Directed st-connectivity is the problem of deciding whether or not there exists a path from a
distinguished node s to a distinguished node t in a directed graph. We prove a time--space …
distinguished node s to a distinguished node t in a directed graph. We prove a time--space …
An O (n½+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability
T Imai, K Nakagawa, A Pavan… - … IEEE Conference on …, 2013 - ieeexplore.ieee.org
We show that the reach ability problem over\em directed planar graphs can be solved
simultaneously in polynomial time and approximately O(n) space. In contrast, the best space …
simultaneously in polynomial time and approximately O(n) space. In contrast, the best space …
[PDF][PDF] New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs
We obtain the following new simultaneous time-space upper bounds for the directed
reachability problem.(1) A polynomial-time, O (n^{2/3}* g^{1/3})-space algorithm for directed …
reachability problem.(1) A polynomial-time, O (n^{2/3}* g^{1/3})-space algorithm for directed …
Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs
The lexicographic depth-first search (Lex-DFS) is one of the first basic graph problems
studied in the context of space-efficient algorithms. It is shown independently by Asano et …
studied in the context of space-efficient algorithms. It is shown independently by Asano et …
Comparing sequences with segment rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting
evolutionary and functional relationships. Until very recently, available portions of the human …
evolutionary and functional relationships. Until very recently, available portions of the human …
Time space tradeoffs (getting closer to the barrier?)
A Borodin - International Symposium on Algorithms and …, 1993 - Springer
We survey the current status of the time-space complexity of various basic computational
problems. For time-space (or space alone) lower bounds, Boolean branching programs are …
problems. For time-space (or space alone) lower bounds, Boolean branching programs are …
[PDF][PDF] STCON in directed unique-path graphs
We study the problem of space-efficient polynomial-time algorithms for {\em directed st-
connectivity}(STCON). Given a directed graph $ G $, and a pair of vertices $ s, t $, the …
connectivity}(STCON). Given a directed graph $ G $, and a pair of vertices $ s, t $, the …