Join-Reachability Problems in Directed Graphs
暂无分享,去创建一个
[1] Loukas Georgiadis,et al. Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs , 2010, ICALP.
[2] Martin Skutella,et al. Reachability substitutes for planar digraphs , 2005 .
[3] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[4] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[5] Joseph JáJá,et al. Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.
[6] Leonidas Palios,et al. Join-Reachability Problems in Directed Graphs , 2010, Theory of Computing Systems.
[7] Philip S. Yu,et al. Dual Labeling: Answering Graph Reachability Queries in Constant Time , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[8] Stephen Alstrup,et al. New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[9] Maurizio Talamo,et al. An Efficient Data Structure for Lattice Operations , 1999, SIAM J. Comput..
[10] Loukas Georgiadis. Computing Frequency Dominators and Related Problems , 2008, ISAAC.
[11] Robert E. Tarjan,et al. Planar point location using persistent search trees , 1986, CACM.
[12] Tiko Kameda,et al. On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..
[13] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[14] Mikkel Thorup,et al. Compact routing schemes , 2001, SPAA '01.
[15] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[16] Alexander Borgida,et al. Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.
[17] Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.
[18] Bernard Chazelle,et al. Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[19] Ioannis G. Tollis,et al. Dynamic Reachability in Planar Digraphs with One Source and One Sink , 1993, Theor. Comput. Sci..
[20] Maurizio Talamo,et al. Compact Implicit Representation of Graphs , 1998, WG.
[21] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[22] Robert E. Tarjan,et al. Dominator tree verification and vertex-disjoint paths , 2005, SODA '05.
[23] Enrico Nardelli,et al. Efficient Searching for Multi-dimensional Data Made Simple , 1999, ESA.
[24] Moni Naor,et al. Rank aggregation methods for the Web , 2001, WWW '01.
[25] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[26] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.