Foremost Walks and Paths in Interval Temporal Graphs-Reference-Cited by-同舟云学术

Foremost Walks and Paths in Interval Temporal Graphs

Published:2022-09-29 Issue:10 Volume:15 Page:361
ISSN:1999-4893
Container-title:Algorithms
language:en
Short-container-title:Algorithms

Author:

Jain Anuj,Sahni Sartaj

Abstract

The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard. We develop a polynomial time algorithm for the single-source all-destinations min-hop foremost paths problem and a pseudopolynomial time algorithm for the single-source all-destinations min-wait foremost walks problem in interval temporal graphs. We benchmark our algorithms against algorithms presented by Bentert et al. for contact sequence graphs and show, experimentally, that our algorithms perform up to 207.5 times faster for finding min-hop foremost paths and up to 23.3 times faster for finding min-wait foremost walks.

Publisher

MDPI AG

Subject

Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science

Link

https://www.mdpi.com/1999-4893/15/10/361/pdf

Reference18 articles.

1. Models and Techniques for Communication in Dynamic Networks;Scheideler;Proceedings of the STACS19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes,2002

2. Location Updates for Efficient Routing in Ad Hoc Networks

3. Temporal networks

4. An Introduction to Temporal Graphs: An Algorithmic Perspective;Michail;arXiv,2015

5. Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics;Santoro;arXiv,2011

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

1. Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle;2023 IEEE Symposium on Computers and Communications (ISCC);2023-07-09