On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs

ENSOR Andrew,LILLO Felipe

Journal of Systems Science & Complexity ›› 2018, Vol. 31 ›› Issue (2) : 527-538.

PDF(222 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(222 KB)
Journal of Systems Science & Complexity ›› 2018, Vol. 31 ›› Issue (2) : 527-538. DOI: 10.1007/s11424-017-6138-0

On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs

  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Complexity, 2018, 31(2): 527-538 https://doi.org/10.1007/s11424-017-6138-0

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(222 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉