Path Algorithms for Contact Sequence Temporal Graphs-Reference-Cited by-同舟云学术

Path Algorithms for Contact Sequence Temporal Graphs

Published:2024-03-30 Issue:4 Volume:17 Page:148
ISSN:1999-4893
Container-title:Algorithms
language:en
Short-container-title:Algorithms

Author:

Gheibi Sanaz¹,Banerjee Tania¹^ORCID,Ranka Sanjay¹^ORCID,Sahni Sartaj¹

Affiliation:

1. Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA

Abstract

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems.

Publisher

MDPI AG

Link

https://www.mdpi.com/1999-4893/17/4/148/pdf

Reference39 articles.

1. Gheibi, S., Banerjee, T., Ranka, S., and Sahni, S. (2021, January 5–8). An Effective Data Structure for Contact Sequence Temporal Graphs. Proceedings of the 2021 IEEE Symposium on Computers and Communications (ISCC), Athens, Greece.

2. Scheideler, C. (2002, January 14–16). Models and techniques for communication in dynamic networks. Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science, Juan les Pins, France.

3. Location updates for efficient routing in ad hoc networks;Stojmenovic;Handb. Wirel. Netw. Mob. Comput.,2002

4. Temporal networks;Holme;Phys. Rep.,2012

5. Liu, Y., Kalagnanam, J.R., and Johnsen, O. (July, January 28). Learning dynamic temporal graphs for oil-production equipment monitoring system. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France.

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

1. GPU Algorithms for Fastest Path Problem in Temporal Graphs;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12