株式会社極東書店トップ ＞ 商品一覧 ＞ Combinatorial Network Theory. Softcover reprint of hardcover 1st ed. 1996.
商品詳細
Combinatorial Network Theory. Softcover reprint of hardcover 1st ed. 1996.
・ISBN 978-1-4419-4752-9 paper EUR 99.99
￥26,726.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Ding-Zhu Du / Hsu, F. (eds.), |
|---|---|
| シリーズ | Applied Optimization |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2010 |
| ページ数 | 214 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-17162＞ |
解説
A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory.
Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.
Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.