On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs
Crossref DOI link: https://doi.org/10.1007/s11424-017-6138-0
Published Online: 2017-05-23
Published Print: 2018-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ensor, Andrew
Lillo, Felipe
License valid from 2017-05-23