๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Combinatorial Network Theory Kluwer

โœ Scribed by Ding-Zhu Du, F. Hsu

Publisher
Springer
Year
1995
Tongue
English
Leaves
110
Series
Applied Optimization
Edition
1
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ 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.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial Network Theory
๐Ÿ“ Combinatorial Network Theory
โœ Y. O. Hamidoune (auth.), Ding-Zhu Du, D. Frank Hsu (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English

<p>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 provid

Combinatorial Network Theory
๐Ÿ“ Combinatorial Network Theory
โœ Y. O. Hamidoune (auth.), Ding-Zhu Du, D. Frank Hsu (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English

<p>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 provid

Combinatorial Network Theory (Applied Op
๐Ÿ“ Combinatorial Network Theory (Applied Optimization)
โœ Ding-Zhu Du, F. Hsu ๐Ÿ“‚ Library ๐Ÿ“… 1995 ๐ŸŒ English

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 provi

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This