Graph Theory and Interconnection Networks
Autor Lih-Hsing Hsu, Cheng-Kuan Linen Limba Engleză Hardback – 26 sep 2008
Preț: 1042.20 lei
Preț vechi: 1634.63 lei
-36% Nou
Puncte Express: 1563
Preț estimativ în valută:
184.43€ • 215.07$ • 161.93£
184.43€ • 215.07$ • 161.93£
Comandă specială
Livrare economică 26 decembrie 25 - 09 ianuarie 26
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781420044812
ISBN-10: 1420044818
Pagini: 720
Ilustrații: 373 b/w images and 840 equations
Dimensiuni: 156 x 234 x 38 mm
Greutate: 1 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
ISBN-10: 1420044818
Pagini: 720
Ilustrații: 373 b/w images and 840 equations
Dimensiuni: 156 x 234 x 38 mm
Greutate: 1 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Public țintă
Academic and Professional Practice & DevelopmentCuprins
Fundamental Concepts. Applications on Graph Isomorphisms. Distance and Diameter. Trees. Eulerian Graphs and Digraphs. Matchings and Factors. Connectivity. Graph Coloring. Hamiltonian Cycles. Planar Graphs. Optimal k-Fault-Tolerant Hamiltonian Graphs. Optimal 1-Fault-Tolerant Hamiltonian Graphs. Optimal k-Fault-Tolerant Hamiltonian-Laceable Graphs. Spanning Connectivity. Cubic 3*-Connected Graphs and Cubic 3*-Laceable Graphs. Spanning Diameter. Pancyclic and Panconnected Property. Mutually Independent Hamiltonian Cycles. Mutually Independent Hamiltonian Paths. Topological Properties of Butterfly Graphs. Diagnosis of Multiprocessor Systems. References. Index.
Notă biografică
Hsu, Lih-Hsing; Lin, Cheng-Kuan
Descriere
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, this book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.