Graph Theory and Interconnection Networks
Regular price
€241.80
14 days return policy
Shipping & Delivery
A01=Cheng-Kuan Lin
A01=Lih-Hsing Hsu
advanced graph theory applications
Author_Cheng-Kuan Lin
Author_Lih-Hsing Hsu
bipartite
Bipartite Graph
Black Vertex
Category=UY
Chromatic Number
circuit
combinatorial optimization
Conditional Diagnosability
cycle
Disjoint Paths
Distinct Vertices
edges
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
euler
Euler Trail
Eulerian Trail
Faulty Vertex
graph coloring algorithms
graph connectivity
hamiltonian
Hamiltonian Cycle
Hamiltonian Graphs
Hamiltonian Path
Independent Set
interconnection network design
Minimum Vertex Cover
multiple
multiprocessor systems
network fault tolerance
Odd Vertices
partite
Partite Sets
path
Path P1
Petersen Graph
Planar Graphs
PMC Model
set
Set Pi
Star Graphs
Vertex Cover
Vertex Set
White Vertex
Product details
- ISBN 9781420044812
- Weight: 1142g
- Dimensions: 156 x 234mm
- Publication Date: 26 Sep 2008
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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, the 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.
Hsu, Lih-Hsing; Lin, Cheng-Kuan
