On the Complexity of Shortest Path Problems on Discounted Cost Graphs

DOI10.1007/978-3-642-37064-9_6zbMath1377.68092OpenAlexW31600139MaRDI QIDQ4910440

Sampath Kannan, Yifei Yuan, Kevin T. Tian, Rajeev Alur

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Theory and application of reciprocal transformation of “path problem” and “time float problem” ⋮ Unnamed Item

This page was built for publication: On the Complexity of Shortest Path Problems on Discounted Cost Graphs