Combinatorial Network Theory

F. Hsu

ISBN 10: 1441947523 / ISBN 13: 9781441947529

Verlag: Springer US, 2010

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - 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.

Bestandsnummer des Verkäufers 9781441947529

Bibliografische Details

• Titel: Combinatorial Network Theory
• Verlag: Springer US
• Erscheinungsjahr: 2010
• Sprache: Englisch
• ISBN-10: 1441947523
• ISBN-13: 9781441947529
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 13 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 13 mm
• Gewicht: 347 Gramm

Über diesen Titel

Inhaltsangabe

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.