The next‐to‐shortest path problem on directed graphs with positive edge weights

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|3|205-211

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.3, 2015-05, pp. : 205-211

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

By Babel L.   Ponomarenko I.N.   Tinhofer G.  

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 542-564

Academic Press

Access to resources Recommend Favorite

A shortest path problem on a network with fuzzy arc lengths

By Okada S.   Soper T.  

Fuzzy Sets and Systems, Vol. 109, Iss. 1, 2000-01 ,pp. : 129-140

Elsevier

Access to resources Recommend Favorite

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

By Ramalingam G.   Reps T.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 267-305

Academic Press

Access to resources Recommend Favorite

Edge Weight Reduction Problems in Directed Acyclic Graphs

By Hambrusch S.E.   Tu H.Y.  

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 66-93

Academic Press

Access to resources Recommend Favorite

Generalized path-finding algorithms on semirings and the fuzzy shortest path problem

By Boulmakoul A.  

Journal of Computational and Applied Mathematics, Vol. 162, Iss. 1, 2004-01 ,pp. : 263-272

Elsevier

Access to resources Recommend Favorite