Solving the Shortest Path Problem with Interval Arcs

ISSN： 1568-4539

Source： Fuzzy Optimization and Decision Making, Vol.5, Iss.1, 2006-01, pp. : 71-89

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

Shortest Path Problem on a Network with Imprecise Edge Weight

By Nayeem SK. Pal Madhumangal

Fuzzy Optimization and Decision Making, Vol. 4, Iss. 4, 2005-10 ,pp. : 293-312

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of the characterization of networks supporting shortest-path interval routing

By Eilam T. Moran S. Zaks S.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 85-104

Elsevier

Access to resources Recommend Favorite

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

By Träff J.L. Zaroliagis C.D.

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 9, 2000-09 ,pp. : 1103-1124

Academic Press

Access to resources Recommend Favorite

An efficient fault-containing self-stabilizing algorithm for the shortest path problem

By Huang Tetz

Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. : 149-161

Springer Publishing Company

Access to resources Recommend Favorite

An anticipation mechanism for the shortest path problem based on Physarum polycephalum

International Journal of General Systems, Vol. 44, Iss. 3, 2015-04 ,pp. : 326-340

Taylor & Francis Ltd

Access to resources Recommend Favorite