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
R2,770 Discovery Miles 27 700 Ships in 18 - 22 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,653 Discovery Miles 26 530 Ships in 18 - 22 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...
Casio LW-200-7AV Watch with 10-Year…
R999 R899 Discovery Miles 8 990
Bostik Wax Twisters (12 Pack)
R86 R50 Discovery Miles 500
Lifespace 10-Piece Portable Camping…
R1,379 R659 Discovery Miles 6 590
The Northman
Alexander Skarsgard, Nicole Kidman, … Blu-ray disc  (1)
R337 Discovery Miles 3 370
Tesa Adjustable Adhesive Nail for Tiles…
R179 Discovery Miles 1 790
Did You Know That There's A Tunnel Under…
Lana Del Rey CD R447 Discovery Miles 4 470
Revealing Revelation - How God's Plans…
Amir Tsarfati, Rick Yohn Paperback  (5)
R199 R183 Discovery Miles 1 830
Treeline Tennis Balls (Pack of 3)
R59 R48 Discovery Miles 480
Dig & Discover: Ancient Egypt - Excavate…
Hinkler Pty Ltd Kit R253 Discovery Miles 2 530
Ultra Link UL-TMT2160 Flat TV Mount Wall…
R199 R167 Discovery Miles 1 670

 

Partners