Author:
Birmelé Etienne,Ferreira Rui,Grossi Roberto,Marino Andrea,Pisanti Nadia,Rizzi Romeo,Sacomoto Gustavo
Publisher
Society for Industrial and Applied Mathematics
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Enumerating all multi-constrained s–t paths on temporal graph;Knowledge and Information Systems;2023-09-27
2. Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Towards Generating Hop-constrained s-t Simple Path Graphs;Proceedings of the ACM on Management of Data;2023-05-26
4. Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
5. TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04