|
|
|
|
Edge-disjoint fibonacci trees in Hypercube
|
|
|
|
|
|
|
|
نویسنده
|
raman i. ,kuppusamy l.
|
|
منبع
|
journal of computer networks and communications - 2014 - دوره : 2014 - شماره : 0
|
|
چکیده
|
The fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the fibonacci numbers. in this paper,we prove that a hypercube of dimension h admits two edge-disjoint fibonacci trees of height h,two edge-disjoint fibonacci trees of height h-2,two edge-disjoint fibonacci trees of height h-4 and so on,as subgraphs. the result shows that an algorithm with fibonacci trees as underlying data structure can be implemented concurrently on a hypercube network with no communication latency. © 2014 indhumathi raman and lakshmanan kuppusamy.
|
|
|
|
|
آدرس
|
school of information technology and engineering,vit university, India, school of computing science and engineering,vit university, India
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|