An Effective Data Structure for Contact Sequence Temporal Graphs

Gheibi, Sanaz; Banerjee, Tania; Ranka, Sanjay; Sahni, Sartaj

doi:10.1109/iscc53001.2021.9631469

Cited by 5 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper extends our previous paper on contact sequence temporal graphs [1]. We have extended our previous work mainly by adding two path-finding algorithms to our proposed TRG data structure.…”

Section: Introductionsupporting

confidence: 52%

“…The fastest paths and the minhop paths algorithms for TRG_Ours have been demonstrated in detail in our earlier work [1]. Using a modified version of the standard DFS (depth first search) for the fastest paths algorithm and a modification of the standard BFS (breadth first search) for the minhop paths algorithm, we can obtain the time complexity of O(n + e) for both where n and e are, respectively, the number of vertices and the number of edges in the transformed graph (TRG_Ours).…”

Section: Fastest and Minhop Paths Algorithms For Trg_oursmentioning

confidence: 99%

See 1 more Smart Citation

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionsupporting

confidence: 52%

Section: Fastest and Minhop Paths Algorithms For Trg_oursmentioning

confidence: 99%