> \pJava Excel API v2.6 Ba==h\:#8X@"1Arial1Arial1Arial1Arial + ) , * `
DC,title[*]contributor[*]keywords[*]date[issued] publisher citationsidentifier[uri]identifier[doi]abstract6One-to-many node-disjoint paths of hyper-star networksF@1;
Laszlo Liptak[Laszlo Liptak];
Eddie Cheng[Eddie Cheng];
@[@];.TOPOLOGICAL PROPERTIES;
GRAPHS;
COMMUNICATION;201209ELSEVIER SCIENCE BV=DISCRETE APPLIED MATHEMATICS, v.160, no.13-14, pp.2006 - 2014Whttp://hdl.handle.net/YU.REPOSITORY/27361;
http://dx.doi.org/10.1016/j.dam.2012.04.006;iIn 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.>5WPrez>`,N;]d
dMbP?_*+%" ,,??U
$~>@
Root EntryWorkbookSummaryInformation(DocumentSummaryInformation8