Andere Kunden interessierten sich auch für
![Embeddings and Factorizations of Banach Spaces]( "Embeddings and Factorizations of Banach Spaces")
Embeddings and Factorizations of Banach Spaces23,99 €![Embeddings and Extensions in Analysis]( "Embeddings and Extensions in Analysis")
Embeddings and Extensions in Analysis39,99 €![Contribution aux problèmes de contact en hyperélasticité non linéaire]( "Contribution aux problèmes de contact en hyperélasticité non linéaire")
Contribution aux problèmes de contact en hyperélasticité non linéaire81,99 €![Differential and Complex Geometry: Origins, Abstractions and Embeddings]( "Differential and Complex Geometry: Origins, Abstractions and Embeddings")
Differential and Complex Geometry: Origins, Abstractions and Embeddings103,99 €![Integral Operators in Non-Standard Function Spaces]( "Integral Operators in Non-Standard Function Spaces")
Integral Operators in Non-Standard Function Spaces81,99 €![Integral Operators in Non-Standard Function Spaces]( "Integral Operators in Non-Standard Function Spaces")
Integral Operators in Non-Standard Function Spaces97,99 €![Diffusion on the Peer-to-Peer Network]( "Diffusion on the Peer-to-Peer Network")
Diffusion on the Peer-to-Peer Network27,99 €
Graph theory is becoming increasingly significant as it is applied to areas of mathematics and science & technology. It is being actively used in fields as varied as biochemistry, electrical engineering, computer science and operations research. Graph embedding is an important technique used in the study of computational capabilities of processor interconnection networks and task distribution. Embeddings of graphs from one class of graphs into another class have important applications in the field of computer science. In the design and implementation of parallel and distributed computing systems, one fundamental issue is the design of the interconnection network through which the computing elements can communicate efficiently. A measure of reliability and fault tolerance of the overall interconnection networks is given by the maximum number of nodes which can fail simultaneously without prohibiting other non-faulty nodes from communicating with others. In this work the authors discussed the embedding parameters such as dilation, congestion and wirelenth of certain interconnection networks. Further, they studied faulty interconnection networks.