Mendeley出力
＜図書＞
Combinatorial network theory
| 責任表示 | edited by Ding-Zhu Du and D. Frank Hsu |
|---|---|
| シリーズ | Applied optimization ; v. 1 |
| データ種別 | 図書 |
| 出版情報 | Dordrecht : Kluwer Academic , 1996 |
| 本文言語 | 英語 |
| 大きさ | vii, 212 p. : ill. ; 25 cm |
| 概要 | Provides a recent solution to the problem that under certain conditions, communications networks must have minimum diameter and maximum connectivity. Deals with Cayley, de Bruijn, and Kautz digraphs, ...hich are candidates for networks of maximum connectivity with given degree and number of nodes; double-loop networks; and broadcasting and the Gossiping problems. The combinatorial aspects of network theory are emphasized throughout. The next two volumes in the nascent series consider linear programming and interval computations. No index. Annotation copyright by Book News, Inc., Portland, OR続きを見る |
| 電子版へのリンク | https://hdl.handle.net/2324/6893138 |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図1F 開架 | 410.1/D 93 | 1996 |
|
026211996000448 |
|
書誌詳細
| 一般注記 | Includes bibliographical references |
|---|---|
| 著者標目 | Du, Dingzhu Hsu, D. Frank (Derbiau Frank), 1948- |
| 件 名 | LCSH:Network analysis (Planning) LCSH:Combinatorial analysis |
| 分 類 | LCC:T57.85 DC20:511/.5 |
| 書誌ID | 1001156678 |
| ISBN | 0792337778 |
| NCID | BA26634075 |
| 巻冊次 | ISBN:0792337778 |
| 登録日 | 2009.09.17 |
| 更新日 | 2009.09.17 |