Efficient Hop-constrained s-t Simple Path Enumeration
- 8 May 2021
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 30 (5) , 799-823
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- Finding $k$ k most favorite products based on reverse top- $t$ t queriesThe VLDB Journal, 2013
- Search result diversificationACM SIGMOD Record, 2010
- Relational retrieval using a combination of path-constrained random walksMachine Learning, 2010
- A dissimilar alternative paths-search algorithm for navigation services: A heuristic approachKSCE Journal of Civil Engineering, 2010
- A query language for biological networksBioinformatics, 2005
- A new implementation of Yen?s ranking loopless paths algorithm4OR, 2003
- On finding dissimilar pathsEuropean Journal of Operational Research, 2000
- On generating all maximal independent setsInformation Processing Letters, 1988
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975