A Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 102 === In 1989, Zehavi and Itai [ Three tree-paths, J. Graph Theory, (1989) ] proposed the following conjecture: a k-connected graph G must possess k independent span- ning trees (ISTs for short) with an arbitrary node as the root. An n-dimensional twisted cube,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69132851341891248328 |