| Combinatorial Network Theory 1996 Edition Contributor(s): Ding-Zhu Du (Editor), Hsu, F. (Editor) |
|
 |
ISBN: 0792337778 ISBN-13: 9780792337775 Publisher: Springer OUR PRICE: $104.49 Product Type: Hardcover - Other Formats Published: December 1995 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Combinatorics - Mathematics | Applied - Mathematics | Discrete Mathematics |
| Dewey: 003.72 |
| LCCN: 95041542 |
| Series: Applied Optimization |
| Physical Information: 0.56" H x 6.14" W x 9.21" (1.10 lbs) 214 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |