On the general graph embedding problem with applications to circuit layout
نویسندگان
چکیده
منابع مشابه
Embedding Graphs in Books : a Layout Problem with Applications to Vlsi Design *
We study the graph-theoretic problem of embedding a graph in a book with its vertices in a line along the spine of the book and its edges on the pages in such a way that edges residing on the same page do not cross. This problem abstracts layout problems arising in the routing of multilayer printed circuit boards and in the design of fault-tolerant processor arrays. In devising an embedding, on...
متن کاملA spring-embedding approach for the facility layout problem
The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facility layout problem is a hard problem, and therefore, exact solution methods are only feasible for small or greatly restricted problems. In this paper, we propose a spring-embedding approach that unlike previous approache...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملGraph Layout for Applications in Compiler Construction
We address graph visualization from the viewpoint of com piler construction Most data structures in compilers are large dense graphs such as annotated control ow graph syntax trees dependency graphs Our main focus is the animation and interactive exploration of these graphs Fast layout heuristics and powerful browsing methods are needed We give a survey of layout heuristics for general directed...
متن کاملTree-Partitions of k-Trees with Applications in Graph Layout
A tree-partition of a graph is a partition of its vertices into ‘bags’ such that contracting each bag into a single vertex gives a forest (after deleting loops and replacing parallel edges by a single edge). It is proved that every k-tree has a tree-partition such that each bag induces a (k 1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGACT News
سال: 1984
ISSN: 0163-5700
DOI: 10.1145/1008949.1008953