✦ LIBER ✦

On a graph partition problem with application to VLSI layout

✍ Scribed by Arunabha Sen; Haiyong Deng; Sumanta Guha

Book ID: 107766004
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 682 KB
Volume: 43
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90017-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A review of graph theory application to

A review of graph theory application to the facilities layout problem

✍ Mohsen MD Hassan; Gary L Hogg 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 812 KB

On a class of metrics related to graph l

On a class of metrics related to graph layout problems

✍ Adam N. Letchford; Gerhard Reinelt; Hanna Seitz; Dirk Oliver Theis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Fast partitioning l-apex graphs with app

Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems

✍ Dimitrios M. Thilikos; Hans L. Bodlaender 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 542 KB

A graph is Z-apex if it can be made planar by removing at most 1 vertices. In this paper we show that the vertex set of any graph not containing an l-apex graph as a minor can be partitioned in linear time into 2' sets inducing graphs with small treewidth. As a consequence, several maximum induced-s

A polynomial-time optimization algorithm

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation

✍ Maharaj Mukherjee; Kanad Chakraborty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Optimal control on a graph with applicat

Optimal control on a graph with application to train scheduling problems

✍ C.J. Goh; A.I. Mees 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 774 KB

On finding a biconnected spanning planar

On finding a biconnected spanning planar subgraph with applications to the facilities layout problem

✍ Olivier Goldschmidt; Alexis Takvorian; Gang Yu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 760 KB