Finding optimal paths in MREP routing

Author： Fleischer R. Golin M. Lea C.-T. Wong S.

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.2, 2004-01, pp. : 57-63

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

Finding Hamiltonian paths in tournaments on clusters

By Huang Chun-Hsi Rajasekaran Sanguthevar Yang Laurence He Xin

Cluster Computing, Vol. 9, Iss. 3, 2006-07 ,pp. : 345-353

Springer Publishing Company

Access to resources Recommend Favorite

On Finding Min-Min Disjoint Paths

By Guo Longkun

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 641-653

Springer Publishing Company

Access to resources Recommend Favorite

Finding optimal subgraphs by local search

By Shimozono S.

Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. : 265-271

Elsevier

Access to resources Recommend Favorite

Ant-based survivable routing in dynamic WDM networks with shared backup paths

By Ngo Son Jiang Xiaohong Le Vinh Horiguchi Susumu

The Journal of Supercomputing, Vol. 36, Iss. 3, 2006-06 ,pp. : 297-307

Springer Publishing Company

Access to resources Recommend Favorite

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

By Gu Q.P. Tamaki H.

Journal of Parallel and Distributed Computing, Vol. 44, Iss. 2, 1997-08 ,pp. : 147-152

Academic Press

Access to resources Recommend Favorite