"On the Complexity of Shortest Path Problems on Discounted Cost Graphs."

Rajeev Alur et al. (2013)

Details and statistics

DOI: 10.1007/978-3-642-37064-9_6

access: closed

type: Conference or Workshop Paper

metadata version: 2021-11-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics