Loading...

Some properties of WK-recursive and swapped networks

Imani, N ; Sharif University of Technology | 2007

402 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-74742-0_76
  3. Publisher: Springer Verlag , 2007
  4. Abstract:
  5. The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks due to their useful recursive structures. © Springer-Verlag Berlin Heidelberg 2007
  6. Keywords:
  7. Graph algorithms ; Graph structures ; Topology ; Trees (mathematics) ; Broadcast algorithm ; Combinatorial analysis ; Combinatorial properties ; Parallel and distributed computing ; Spanning tree construction ; Surface area ; Topological properties ; WK-recursive network ; Interconnection networks (circuit switching)
  8. Source: 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, 29 August 2007 through 31 August 2007 ; Volume 4742 LNCS , 2007 , Pages 856-867 ; 03029743 (ISSN); 3540747419 (ISBN); 9783540747413 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-540-74742-0_76