Enumerating all multi-constrained s-t paths on temporal graph
- 27 September 2023
- journal article
- research article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (2) , 1135-1165
Abstract
No abstract availableKeywords
Funding Information
- Innovation Capability Improvement Plan Project of Hebei Province (22567626H, 22567626H)
This publication has 45 references indexed in Scilit:
- Temporal networksPhysics Reports, 2012
- Improved algorithms for the k simple shortest paths and the replacement paths problemsInformation Processing Letters, 2009
- Patterns and dynamics of users' behavior and interaction: Network analysis of an online communityJournal of the American Society for Information Science and Technology, 2009
- Finding the k shortest simple pathsACM Transactions on Algorithms, 2007
- A query language for biological networksBioinformatics, 2005
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Dynamic cycle detectionInformation Processing Letters, 1983
- Petri net approach to enumerate all simple paths in a graphElectronics Letters, 1980
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959