Combinatorial Network Theory

  • Ding-Zhu Du
  • D. Frank Hsu

Part of the Applied Optimization book series (APOP, volume 1)

Table of contents

  1. Front Matter
    Pages i-vii
  2. Ralph Tindell
    Pages 41-64
  3. Ding-Zhu Du, Feng Cao, D. Frank Hsu
    Pages 65-105
  4. Frank K. Hwang, Wen-Ching Winnie Li
    Pages 107-124
  5. Juraj Hromkovič, Ralf Klasing, Burkhard Monien, Regine Peine
    Pages 125-212
  6. Back Matter
    Pages 213-213

About this book

Introduction

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.

Keywords

Computer Graph Information Node communication computer science theoretical computer science

Editors and affiliations

  • Ding-Zhu Du
    • 1
  • D. Frank Hsu
    • 2
  1. 1.University of MinnesotaUSA
  2. 2.Fordham UniversityUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4757-2491-2
  • Copyright Information Springer-Verlag US 1996
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-4752-9
  • Online ISBN 978-1-4757-2491-2
  • Series Print ISSN 1384-6485
  • About this book