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,057 Discovery Miles 30 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 (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,927 Discovery Miles 29 270 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...
Loot
Nadine Gordimer Paperback  (2)
R205 R168 Discovery Miles 1 680
Loot
Nadine Gordimer Paperback  (2)
R205 R168 Discovery Miles 1 680
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Dune: Part 2
Timothee Chalamet, Zendaya, … DVD R221 Discovery Miles 2 210
Baby Dove Shampoo Rich Moisture 200ml
R50 R33 Discovery Miles 330
Beach / Yoga Mat
R104 Discovery Miles 1 040
Goldair USB Fan (Black | 15cm)
R150 Discovery Miles 1 500
Vital BabyŽ Splash Squirt And Splash…
R73 R45 Discovery Miles 450
Avengers: 4-Movie Collection - The…
Robert Downey Jr., Chris Evans, … Blu-ray disc R589 Discovery Miles 5 890
Focus Office Desk Chair (Black)
R1,199 R989 Discovery Miles 9 890

 

Partners