The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang,
✦ LIBER ✦
Optimal Independent Spanning Trees on Odd Graphs
✍ Scribed by Jong-Seok Kim; Hyeong-Ok Lee; Eddie Cheng; László Lipták
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 749 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Parallel construction of optimal indepen
✍
Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 212 KB
Independent spanning trees on folded hyp
✍
Jinn-Shyong Yang; Jou-Ming Chang
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 302 KB
## Abstract Fault‐tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple independent spanning trees (ISTs) as a broadcasting scheme or a distribution protocol for receiving high levels of fault‐toleran
On the spanning trees of weighted graphs
✍
Ernst W. Mayr; C. Greg Plaxton
📂
Article
📅
1992
🏛
Springer-Verlag
🌐
English
⚖ 874 KB
On finding optimal and near-optimal line
✍
Michael R. Fellows; Donald K. Friesen; Michael A. Langston
📂
Article
📅
1988
🏛
Springer
🌐
English
⚖ 646 KB
An optimal pram algorithm for a spanning
✍
Debashis Bera; Madhumangal Pal; Tapan K. Pal
📂
Article
📅
2003
🏛
Springer-Verlag
🌐
English
⚖ 143 KB
Non-uniform random spanning trees on wei
✍
M. Mosbah; N. Saheb
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 547 KB