Improved floor-planning of graphs via adjacency-preserving transformations

Huaming Zhang () and Sadish Sadasivam
Additional contact information
Huaming Zhang: University of Alabama in Huntsville
Sadish Sadasivam: University of Alabama in Huntsville

Journal of Combinatorial Optimization, 2011, vol. 22, issue 4, No 18, 726-746

Abstract: Abstract Let G=(V,E) and G′=(V′,E′) be two graphs, an adjacency-preserving transformation from G to G′ is a one-to-many and onto mapping from V to V′ satisfying the following: (1) Each vertex v∈V in G is mapped to a non-empty subset $\mathcal{A}(v)\subset V'$ in G′. The subgraph induced by $\mathcal{A}(v)$ is a connected subgraph of G′; (2) if u≠v∈V, then $\mathcal{A}(u)\cap\mathcal{A}(v)=\emptyset$ ; and (3) two vertices u and v are adjacent to each other in G if and only if subgraphs induced by $\mathcal{A}(u)$ and $\mathcal{A}(v)$ are connected in G′. In this paper, we study adjacency-preserving transformations from plane triangulations to irreducible triangulations (which are internally triangulated, with four exterior vertices and no separating triangles). As one shall see, our transformations not only preserve adjacency well, but also preserve the endowed realizers of plane triangulations well in the endowed transversal structures of the image irreducible triangulations, which may be desirable in some applications. We then present such an application in floor-planning of plane graphs. The expected grid size of the floor-plan of our linear time algorithm is improved to $(\frac{5n}{8}+O(1))\times (\frac{23n}{24}+O(1))$ , though the worst case grid size bound of the algorithm remains $\lfloor\frac{2n+1}{3}\rfloor\times(n-1)$ , which is the same as the algorithm presented in Liao et al. (J. Algorithms 48:441–451, 2003).

Keywords: Floor-plan; Rectangular dual; Plane triangulation; Irreducible triangulation (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9324-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9324-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9324-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().