Abstract
We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such prior algorithm is known for ITGs. We benchmark our ITG algorithm against that for CSGs using datasets that can be solved using either algorithm. Using synthetic datasets, experimentally, we show that our algorithm for ITGs obtains a speedup of up to 32.5 relative to the state-of-the-art algorithm for CSGs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.