0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Combinatorial Network Theory (Hardcover, 1996 ed.): Dingzhu Du, F. Hsu Combinatorial Network Theory (Hardcover, 1996 ed.)
Dingzhu Du, F. Hsu
R3,000 Discovery Miles 30 000 Ships in 10 - 15 working days

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.

Combinatorial Network Theory (Paperback, Softcover reprint of hardcover 1st ed. 1996): Dingzhu Du, F. Hsu Combinatorial Network Theory (Paperback, Softcover reprint of hardcover 1st ed. 1996)
Dingzhu Du, F. Hsu
R2,873 Discovery Miles 28 730 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
By Himself - The Authorised Book Of…
Nelson Mandela Paperback R220 R198 Discovery Miles 1 980
In a Japanese Garden
Charmaine Aserappe Re Hardcover R315 R292 Discovery Miles 2 920
Illustrations of Biblical Literature…
James Townley Paperback R754 Discovery Miles 7 540
How to Slowly Kill Yourself and Others…
Kiese Laymon Paperback R377 R347 Discovery Miles 3 470
The Nonconformist's Memorial - Being an…
Edmund Calamy Paperback R790 Discovery Miles 7 900
City of Saints and Madmen
Jeff Vandermeer Paperback R590 R544 Discovery Miles 5 440
Goebel Figurines and Prints by Charlotte…
Rocky Rockholt Paperback R579 R520 Discovery Miles 5 200
Maximian; a Tragedy - Taken from…
Thomas Corneille Paperback R401 Discovery Miles 4 010
Everyone Is Still Alive
Cathy Rentzenbrink Paperback R335 R188 Discovery Miles 1 880
The Letters of Marcus Tullius Cicero to…
Marcus Tullius Cicero Paperback R676 Discovery Miles 6 760

 

Partners