TY - JOUR
AU - 김성원
AU - Laszlo Liptak[Laszlo Liptak]
AU - Eddie Cheng[Eddie Cheng]
AU - 김종석[김종석]
DA - 201209
UR - http://hdl.handle.net/YU.REPOSITORY/27361
UR - http://dx.doi.org/10.1016/j.dam.2012.04.006
AB - In practice, it is important to construct node-disjoint paths in networks, because they can be used to increase the transmission rate and enhance the transmission reliability. The hyper-star networks HS(2n, n) were introduced to be a competitive model for both the hypercubes and the star graphs. In this paper, one-to-many node-disjoint paths are constructed between a fixed node and n other nodes of HS(2n, n) such that each of these paths has length at most 4 more than the shortest path to that node. Moreover, their maximum length is not greater than the diameter + 2. (C) 2012 Elsevier B.V. All rights reserved.
LA - 영어
PB - ELSEVIER SCIENCE BV
KW - TOPOLOGICAL PROPERTIES
KW - GRAPHS
KW - COMMUNICATION
TI - One-to-many node-disjoint paths of hyper-star networks
ER -