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 (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,957 Discovery Miles 29 570 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 (Hardcover, 1996 ed.): Dingzhu Du, F. Hsu Combinatorial Network Theory (Hardcover, 1996 ed.)
Dingzhu Du, F. Hsu
R3,094 Discovery Miles 30 940 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...
First Aid Dressing No 5
R9 Discovery Miles 90
Chicco First Dreams Rainbow Sky 2 in 1…
R700 R559 Discovery Miles 5 590
Comfort Food From Your Slow Cooker - 100…
Sarah Flower Paperback R550 R455 Discovery Miles 4 550
Peptine Pro Canine/Feline Hydrolysed…
R359 R279 Discovery Miles 2 790
Dell E2222H 21.5" FHD Monitor
R2,899 R1,949 Discovery Miles 19 490
The Girl On the Train
Emily Blunt, Rebecca Ferguson, … Blu-ray disc  (1)
R64 Discovery Miles 640
Peptine Pro Equine Hydrolysed Collagen…
 (2)
R359 R279 Discovery Miles 2 790
First Aid Dressing No 3
R5 Discovery Miles 50
Spectra S1 Double Rechargeable Breast…
 (46)
R3,999 R3,679 Discovery Miles 36 790
Large 1680D Boys & Girls Backpack…
R507 Discovery Miles 5 070

 

Partners