Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 11 papers published in subject: > since this site started. |
Results per page: | 11 Total, 2 Pages | << First < Previous 1 2 |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Disjoint Paths between Adjacent Vertices in Bijective Connection Networks | |||
Cheng Baolei ,Jianxi Fan | |||
Computer Science and Technology 01 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Bijective connection networks are a family of hypercube variants, which contains hypercubes, twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes, etc. In this paper, we study the exitence of n disjoint paths between two adjacent vertices in any n-dimensional bijective connection network Xn and develop an parallel Algorithm XST, which can run in O(N) time, to construct n disjoint paths between arbitrary vertex and its 0-neighbor vertex in Xn, where the maximum length of which is less than or equal to n+1. | |||
TO cite this article:Cheng Baolei ,Jianxi Fan. Disjoint Paths between Adjacent Vertices in Bijective Connection Networks[OL].[ 1 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4453197 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: | 11 Total, 2 Pages | << First < Previous 1 2 |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated