김성원
Laszlo Liptak[Laszlo Liptak]
Eddie Cheng[Eddie Cheng]
김종석[김종석]
2015-12-17T02:13:56Z
2015-12-17T02:13:56Z
2015-11-13
201209
DISCRETE APPLIED MATHEMATICS, v.160, no.13-14, pp.2006 - 2014
0166-218X
http://hdl.handle.net/YU.REPOSITORY/27361
http://dx.doi.org/10.1016/j.dam.2012.04.006
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.
Made available in DSpace on 2015-12-17T02:13:56Z (GMT). No. of bitstreams: 0
영어
ELSEVIER SCIENCE BV
TOPOLOGICAL PROPERTIES
GRAPHS
COMMUNICATION
One-to-many node-disjoint paths of hyper-star networks
Article
000306298600012
2-s2.0-84862217512
619
ART
20501081