Incremental algorithms for minimal length paths-Reference-Cited by-同舟云学术

Incremental algorithms for minimal length paths

Author:

Ausiello Giorgio,Italiano Giuseppe F,Marchetti Spaccamela Alberto,Nanni Umberto

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference38 articles.

1. Efficient management of transitive relationships in large data and knowledge bases;Agrawal,1989

2. The Design and Analysis of Computer Algorithms;Aho,1974

3. Incremental algorithms for minimal length paths;Ausiello,1990

4. Dynamic maintenance of paths and path expressions in graphs;Ausiello,1989

5. A data structure for arc insertion and regular path finding;Buchsbaum,1990

Cited by 99 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Predictive Behavior Modeling Through Web Graphs: Enhancing Next Page Prediction Using Dynamic Link Repository;2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT);2023-10-26

4. The multi-objective dynamic shortest path problem;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

5. Subquadratic dynamic path reporting in directed graphs against an adaptive adversary;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09