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...
Dare To Believe - Why I Could Not Stay…
Mmusi Maimane Paperback R350 R249 Discovery Miles 2 490
Sylvanian Families - Walnut Squirrel…
R749 R579 Discovery Miles 5 790
Google Nest Mini Smart Speaker Home…
R3,999 Discovery Miles 39 990
Chicco Natural Feeling Manual Breast…
R799 Discovery Miles 7 990
Barbie
Margot Robbie, Ryan Gosling Blu-ray disc R266 Discovery Miles 2 660
Conforming Bandage
R3 Discovery Miles 30
ZA Choker Necklace
R570 R399 Discovery Miles 3 990
Bostik Glue Stick Value Pack (3 x 25g)
R105 Discovery Miles 1 050
Bostik Glue Stick - Loose (25g)
R31 Discovery Miles 310
Speak Now - Taylor's Version
Taylor Swift CD R527 Discovery Miles 5 270

 

Partners