Combinatorial Network Theory (Applied Optimization)

✍ Scribed by Ding-Zhu Du, F. Hsu

Year: 1995
Tongue: English
Leaves: 216
Edition: 1
Category: Library

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 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, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

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

Applications of Combinatorial Optimizati

📁 Applications of Combinatorial Optimization: Th. Paschos/Applications of Combinatorial Optimization

✍ Th. Paschos, Vangelis (editor) 📂 Library 📅 2013 🏛 John Wiley & Sons, Inc.

Combinatorial Optimization: Networks and

📁 Combinatorial Optimization: Networks and Matroids

✍ Eugene L. Lawler 📂 Library 📅 1995 🏛 Oxford University Press, USA 🌐 English

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the ma

Combinatorial Optimization in Communicat

📁 Combinatorial Optimization in Communication Networks

✍ Maggie Xiaoyan Cheng, Yingshu Li, Ding-Zhu Du 📂 Library 📅 2006 🏛 Springer 🌐 English

This book gives a comprehensive presentation of cutting-edge research in communication networks with a combinatorial optimization component. The objective of the book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Each chapter is writte