Jasintha Quadras (4 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 44.99
£ 59.84 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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, Lengeriche…r Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 116.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 43.37
£ 41.88 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 52.57
£ 52.33 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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 c…reating 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.
