Embeddings and Interconnection Networks: A Study of the Dilation, Congestion and Congestion-sum Problems of Graph Embeddings - Softcover

Quadras, Jasintha; Rajasingh, Indra

Softcover

ISBN 10: 3848424878 ISBN 13: 9783848424870

Publisher: LAP LAMBERT Academic Publishing, 2012

Synopsis

Embeddings of graphs have important applications in Computer Science and are of particular interest in the area of interconnection networks. Dr. Sr. Jasintha’s work is a ground-breaking study in embedding techniques. The secret lies in creating the ability to estimate the congestion-sum of embedding different architectures. Sr. Jasintha works with a paradigm of graphs that includes cycles, wheels, generalized wheels, a class of caterpillars, hypercubes, and Petersen graphs as guest graphs and trees as host graphs; and she demonstrates a novel technique of computing the dilation-sum of graph embeddings. Highly commended as a doctoral thesis, the prominent feature of Dr. Sr. Jasintha’s study is that all the embeddings considered are elegant and they produce optimal congestion-sum in linear time. This opens up a world of possibilities for computer applications in network architecture. This study has inspired several other theses in the field of networking both internationally and at home.

About this title

About the Author

Dr. Sr. Jasintha Quadras, fmm, Principal, Stella Maris College, Chennai, India, holds a Doctorate in Mathematics, a PG Diploma in Computer Applications and an MS in Computer Science; her specialization is Graph Theory. Dr. Indra Rajasingh, Research Guide and former Head, Department of Mathematics, Loyola College, supervised this dissertation.

Edition details

• Publisher: LAP LAMBERT Academic Publishing
• Publication date: 2012
• Language: English
• ISBN 10: 3848424878
• ISBN 13: 9783848424870
• Binding: Paperback
• Number of pages: 152