Full metadata record

DC FieldValueLanguage
dc.contributor.author김성원ko
dc.contributor.authorLaszlo Liptak[Laszlo Liptak]ko
dc.contributor.authorEddie Cheng[Eddie Cheng]ko
dc.contributor.author김종석[김종석]ko
dc.date.accessioned2015-12-17T02:13:56Z-
dc.date.available2015-12-17T02:13:56Z-
dc.date.created2015-11-13-
dc.date.issued201209-
dc.identifier.citationDISCRETE APPLIED MATHEMATICS, v.160, no.13-14, pp.2006 - 2014-
dc.identifier.issn0166-218X-
dc.identifier.urihttp://hdl.handle.net/YU.REPOSITORY/27361-
dc.identifier.urihttp://dx.doi.org/10.1016/j.dam.2012.04.006-
dc.description.abstractIn 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.-
dc.language영어-
dc.publisherELSEVIER SCIENCE BV-
dc.subjectTOPOLOGICAL PROPERTIES-
dc.subjectGRAPHS-
dc.subjectCOMMUNICATION-
dc.titleOne-to-many node-disjoint paths of hyper-star networks-
dc.typeArticle-
dc.identifier.wosid000306298600012-
dc.identifier.scopusid2-s2.0-84862217512-
Appears in Collections:
공과대학 > 모바일정보통신공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE