Combinatorial Network Theory (1996) (Applied Optimization #1)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1996
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781475724912
- Related ISBNs:
- 9780792337775
- Publisher:
- Springer US
- Date of Addition:
- 01/24/21
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
- Edited by:
- Ding-Zhu Du
- Edited by:
- F. Hsu
Reviews
Other Books
- by Ding-Zhu Ding-Zhu Du
- by F. Hsu
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics