Computing weight constraint reachability in large networks
- 28 August 2012
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 22 (3) , 275-294
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- PathFinder: mining signal transduction pathway segments from protein-protein interaction networksBMC Bioinformatics, 2007
- Power laws, Pareto distributions and Zipf's lawContemporary Physics, 2005
- External memory algorithms and data structuresACM Computing Surveys, 2001
- Querying multi-dimensional data indexed using the Hilbert space-filling curveACM SIGMOD Record, 2001
- Finding Regular Simple Paths in Graph DatabasesSIAM Journal on Computing, 1995
- A graph generation software packageACM SIGCSE Bulletin, 1991
- A compression technique to materialize transitive closureACM Transactions on Database Systems, 1990
- Efficient management of transitive relationships in large data and knowledge basesACM SIGMOD Record, 1989
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956