Efficiently answering reachability queries on very large directed graphs
Authors:
Open Access
- 9 June 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 595-608
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Fast and practical indexing and querying of very large graphs2007
- Fast Computation of Reachability Labeling for Large Graphs2006
- HOPI: An Efficient Connection Index for Complex XML Document Collections2004
- Computational Geometry2000
- A compression technique to materialize transitive closureACM Transactions on Database Systems, 1990
- Efficient management of transitive relationships in large data and knowledge bases1989
- An improved algorithm for transitive closure on acyclic digraphsTheoretical Computer Science, 1988
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- On the vector representation of the reachability in planar directed graphsInformation Processing Letters, 1975
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967