On the complexity of equal shortest path routing

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|4|344-352

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.4, 2015-07, pp. : 344-352

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

Worst Case Bounds for Shortest Path Interval Routing

By Gavoille C.   Guevremont E.  

Journal of Algorithms, Vol. 27, Iss. 1, 1998-04 ,pp. : 1-25

Academic Press

Access to resources Recommend Favorite

Open shortest path first routing under random early detection

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 71, Iss. 2, 2018-03 ,pp. : 120-135

John Wiley & Sons Inc

Access to resources Recommend Favorite

The shortest path improvement problems under Hamming distance

By Zhang Binwu   Zhang Jianzhong   Qi Liqun  

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 351-361

Springer Publishing Company

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