This book presents an in-depth exploration of 'dynamic grid embedding', an innovative technique in computer science. It delves into optimizing the compression of partial grids, such as those containing missing nodes or edges. The author provides a case study of embedding techniques that map partial grids into smaller ones with optimal area and bounded dilation, introducing the concept of boundary dilation. The book also includes complexity results and lower bound estimates for specific cases of grid embedding. By examining the expansion, dilation, and boundary dilation aspects of partial grid embedding simultaneously, this book contributes to a new set of design-related problems. It is a valuable resource for researchers and practitioners in computer science, particularly those interested in graph embedding, VLSI design, and systolic arrays. The insights gained from this book have the potential to improve the efficiency and performance of integrated circuits and other computational systems, paving the way for advancements in various technological applications.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Explore how partial grids can be compressed without losing shape or speed. This book presents methods for embedding partial grids into near-ideal squares, balancing expansion and dilation to control layout quality. It covers key techniques like folding and compression, with practical insights for VLSI design and graph layouts.Partial-grid concepts are introduced with step-by-step ideas on partitioning, critical lines, and how holes or corners affect embedding. The work also surveys theoretical limits, including when dilation remains small and when problems become computationally hard. Clear explanations of embedding partial grids, dilation, and expansion concepts. Detailed discussion of folding and compression methods and when they work best. Connections to practical design problems in VLSI and graph layouts. Notes on conjectures, complexity results, and potential extensions.Ideal for readers involved in graph theory, algorithm design, and grid-based layout optimization who want a rigorous, application-focused reference. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333364960_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333364960
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333364960
Quantity: 15 available