|
目录
| |
(Mathematics
Monograph Series 26)(数学专著系列（英文版）26)
 |
标题:
|
Combinatorial
Theory in Networks
|
|
作者:
|
Jun-Ming
Xu (徐俊明)
|
| 出版社:
|
Academic Press, Beijing ( 科学出版社)
|
| 书号:
|
ISBN
978-7-03-036478-4
页数:
409+6
|
| 出版日期:
|
2013.01
|
字数：430千字
|
装帧：精装
|
| 书价:
|
128:00
|
|
|
|
|
邮购: |
亚马逊 京东
当当网 易购
|
This book provides the most basic combinatorial
problems and well-established theory in design and analysis of the topological
structure of interconnection networks in the graph-theoretic language. It covers
the basic methods of network design, several well-known networks such as
hypercubes, de Bruijn digraphs, Kautz digraphs, double loop, and the newest
parameters to measure performance of networks such as forwarding indices of a
routing, Menger number, Rabin number, fault-tolerant diameter, wide-diameter,
generalized dominating number, and restricted connectivity.
It will be of significant interest to researchers and
practitioners working in design and analysis of networks, particularly to
undergraduates and postgraduates specializing in computer science and applied
mathematics.
|