Layout of planar products

Yuli Chen

Abstract

Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a way that a certain objective function is optimized. In this paper, planar direct products and their stack and queue layouts are determined. The stack and queue numbers are directly motivated by VLSI layout problems.

Full Text: PDF

How to Cite this Article

Yuli Chen, Layout of planar products, J. Math. Comput. Sci., 6 (2016), 216-229

Copyright © 2016 Yuli Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.