Crossmark

Algorithms for optimal min hop and foremost paths in interval temporal graphs

Crossref DOI link: https://doi.org/10.1007/s41109-022-00499-3

Published Online: 2022-08-29

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Jain, Anuj https://orcid.org/0000-0002-3837-5014
Sahni, Sartaj K.
License Information

Text and Data Mining valid from 2022-08-29

Version of Record valid from 2022-08-29
More Information

Article History

Received: 2 October 2021

Accepted: 11 August 2022

First Online: 29 August 2022

Declarations

:

: The authors declare that they have no competing interests.