Combinatorial Network Theory (Paperback, Softcover reprint of hardcover 1st ed. 1996)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Applied Optimization, 1
Release date:	December 2010
First published:	1996
Editors:	Dingzhu Du • F. Hsu
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Paperback
Pages:	214
Edition:	Softcover reprint of hardcover 1st ed. 1996
ISBN-13:	978-1-4419-4752-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	1-4419-4752-3
Barcode:	9781441947529

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!