85
Views
10
CrossRef citations to date
0
Altmetric
Section A

General-demand disjoint path covers in a graph with faulty elements

&
Pages 606-617 | Received 13 Jul 2011, Accepted 09 Jan 2012, Published online: 13 Feb 2012

References

  • Bondy , J. A. and Murty , U. S.R. 2008 . Graph Theory , 2printing , Berlin : Springer .
  • Chang , C.-H. , Lin , C.-K. , Huang , H.-M. and Hsu , L.-H. 2004 . The super laceability of the hypercubes . Inform. Process. Lett , 92 ( 1 ) : 15 – 21 .
  • Chen , X.-B. 2009 . Many-to-many disjoint paths in faulty hypercubes . Inform. Sci , 179 ( 18 ) : 3110 – 3115 .
  • Chen , X.-B. 2010 . Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs . Inform. Process. Lett , 110 ( 6 ) : 203 – 205 .
  • Chen , C. , Chang , C.-C. and Chang , G. J. 1997 . Proper interval graphs and the guard problem . Discrete Math , 170 ( 1–3 ) : 223 – 230 .
  • Dvořák , T. and Gregor , P. 2008 . Partitions of faulty hypercubes into paths with prescribed endvertices . SIAM J. Discrete Math , 22 ( 4 ) : 1448 – 1461 .
  • Gregor , P. and Dvořák , T. 2008 . Path partitions of hypercubes . Inform. Process. Lett , 108 ( 6 ) : 402 – 406 .
  • Lai , P.-L. and Hsu , H.-C. 2008 . The two-equal-disjoint path cover problem of matching composition network . Inform. Process. Lett , 107 ( 1 ) : 18 – 23 .
  • Liu , D. and Li , J. 2010 . Many-to-many n-disjoint path covers in n-dimensional hypercubes . Inform. Process. Lett , 110 ( 14–15 ) : 580 – 584 .
  • Park , J.-H. 2003 . One-to-one disjoint path covers in recursive circulants . J. KISS , 30 ( 12 ) : 691 – 698 . (in Korean)
  • Park , J.-H. 2004 . “ One-to-many disjoint path covers in a graph with faulty elements ” . In Proceedings of the International Computing and Combinatorics Conference COCOON 2004 Jeju , , Korea
  • Park , J.-H. 2006 . Unpaired many-to-many disjoint path covers in hypercube-like interconnection networks . J. KISS , 33 ( 10 ) : 789 – 796 . (in Korean)
  • Park , J.-H. , Kim , H.-C. and Lim , H.-S. 2005 . “ Fault-hamiltonicity of hypercube-like interconnection networks ” . In Proceedings of the IEEE International Parallel and Distributed Processing Symposium IPDPS 2005 Denver , CO
  • Park , J.-H. , Kim , H.-C. and Lim , H.-S. 2006 . Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements . IEEE Trans. Parallel Distrib. Syst , 17 ( 3 ) : 227 – 240 .
  • Park , J.-H. , Kim , H.-C. and Lim , H.-S. 2009 . Many-to-many disjoint path covers in the presence of faulty elements . IEEE Trans. Comput , 58 ( 4 ) : 528 – 540 .
  • Roberts , F. S. 1969 . “ Indifference graphs ” . In Proof Techniques in Graph Theory , Edited by: Harary , F. 139 – 146 . New York : Academic Press .
  • Tsai , C.-H. , Tan , J. J.M. and Hsu , L.-H. 2004 . The super-connected property of recursive circulant graphs . Inform. Process. Lett , 91 ( 6 ) : 293 – 298 .
  • Vaidya , A. S. , Rao , P. S.N. and Shankar , S. R. 1993 . “ A class of hypercube-like networks ” . In Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing (SPDP) Dallas , TX

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.