Join-Reachability Problems in Directed Graphs

For a given collection G of directed graphs we define the joinreachability graph of G, denoted by J (G), as the directed graph that, for any pair of vertices a and b, contains a path from a to b if and only if such a path exists in all graphs of G. Our goal is to compute an efficient representation of J (G). In particular, we consider two versions of this problem. In the explicit version we wish to construct the smallest joinreachability graph for G. In the implicit version we wish to build an efficient data structure (in terms of space and query time) such that we can report fast the set of vertices that reach a query vertex in all graphs of G. This problem is related to the well-studied reachability problem and is motivated by emerging applications of graph-structured databases and graph algorithms. We consider the construction of join-reachability structures for two graphs and develop techniques that can be applied to both the explicit and the implicit problem. First we present optimal and near-optimal structures for paths and trees. Then, based on these results, we provide efficient structures for planar graphs and general directed graphs.

[1]  Martin Skutella,et al.  Reachability substitutes for planar digraphs , 2005 .

[2]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[3]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[4]  Loukas Georgiadis.  Computing Frequency Dominators and Related Problems , 2008, ISAAC.

[5]  Maurizio Talamo,et al.  An Efficient Data Structure for Lattice Operations , 1999, SIAM J. Comput..

[6]  Mikkel Thorup.  Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[7]  Loukas Georgiadis,et al.  Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs , 2010, ICALP.

[8]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[9]  Enrico Nardelli,et al.  Efficient Searching for Multi-dimensional Data Made Simple , 1999, ESA.

[10]  Ioannis G. Tollis,et al.  Dynamic Reachability in Planar Digraphs with One Source and One Sink , 1993, Theor. Comput. Sci..

[11]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[12]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[13]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[14]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[15]  Leonidas Palios,et al.  Join-Reachability Problems in Directed Graphs , 2013, Theory of Computing Systems.

[16]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[17]  Robert E. Tarjan,et al.  Dominator tree verification and vertex-disjoint paths , 2005, SODA '05.

[18]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[19]  Maurizio Talamo,et al.  Compact Implicit Representation of Graphs , 1998, WG.

[20]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[21]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[22]  Philip S. Yu,et al.  Dual Labeling: Answering Graph Reachability Queries in Constant Time , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[23]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[24]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[25]  Joseph JáJá,et al.  Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.