Static and dynamic low-congested interval routing schemes

Author： Cicerone S. Di Stefano G. Flammini M.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.276, Iss.1, 2002-04, pp. : 315-354

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

Multidimensional interval routing schemes

By Flammini M. Gambosi G. Nanni U. Tan R.B.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 115-133

Elsevier

Access to resources Recommend Favorite

On the complexity of multi-dimensional interval routing schemes

By Ruzicka P. Stefankovic D.

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 255-280

Elsevier

Access to resources Recommend Favorite

Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks

By Calamoneri T. Di Ianni M.

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 11, 2003-11 ,pp. : 1017-1025

Elsevier

Access to resources Recommend Favorite

A survey on interval routing

By Gavoille C.

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 217-253

Elsevier

Access to resources Recommend Favorite

On devising Boolean Routing Schemes

By Flammini M. Gambosi G.

Theoretical Computer Science, Vol. 186, Iss. 1, 1997-10 ,pp. : 171-198

Elsevier

Access to resources Recommend Favorite