Lingua: Inglese
Editore: LAP Lambert Academic Publishing, 2012
ISBN 10: 3848424878 ISBN 13: 9783848424870
Da: preigu, Osnabrück, Germania
EUR 51,10
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Embeddings and Interconnection Networks | A Study of the Dilation, Congestion and Congestion-sum Problems of Graph Embeddings | Jasintha Quadras (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783848424870 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3848424878 ISBN 13: 9783848424870
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 140,25
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3848424878 ISBN 13: 9783848424870
Da: moluna, Greven, Germania
EUR 49,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Quadras JasinthaDr. 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 Theor.
Lingua: Inglese
Editore: LAP Lambert Academic Publishing, 2012
ISBN 10: 3848424878 ISBN 13: 9783848424870
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 59,71
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.