 |


|
 |
Item Details
Title:
|
COMBINATORIAL NETWORK THEORY
|
By: |
Dingzhu Dhu (Editor), D. Frank Hsu (Editor) |
Format: |
Hardback |

List price:
|
£109.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
0792337778 |
ISBN 13: |
9780792337775 |
Publisher: |
SPRINGER |
Pub. date: |
31 December, 1995 |
Edition: |
1996 ed. |
Series: |
Applied Optimization 1 |
Pages: |
214 |
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 solution to this problem. |
Synopsis: |
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. |
Illustrations: |
VIII, 214 p. |
Publication: |
Netherlands |
Imprint: |
Springer |
Returns: |
Returnable |
|
|
|
 |


|

|

|

|

|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.

|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...

|

|

|
|
 |