Interval routing & layered cross product
β
Tiziana Calamoneri; Miriam Di Ianni
π
Article
π
2003
π
Elsevier Science
π
English
β 291 KB
In this paper we propose compact routing schemes having space and time complexities comparable to a 2-interval routing scheme for the class of networks decomposable as layered cross product (LCP) of rooted trees. As a consequence, we are able to design a ''quasi'' 2-interval routing scheme (i.e. a 2