Abstract
This paper deals with problems on non-oriented edge-colored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated non-negative reload cost ri,j, where i and j denote, respectively, the colors of successive edges in this walk. The goal is to find a route whose total reload cost is minimum. Polynomial algorithms and proofs of NP-hardness are given for particular cases: when the triangle inequality is satisfied or not, when reload costs are symmetric (i.e. ri,j = rj,i) or asymmetric. We also investigate bounded degree graphs and planar graphs. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Gourvc̀es, L., Lyra, A., Martinhon, C., & Monnot, J. (2009). The minimum reload s-t path/trail/walk problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 621–632). Springer Verlag. https://doi.org/10.1007/978-3-540-95891-8_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
