RAIRO-Theor. Inf. Appl.
Volume 47, Number 2, April-June 2013
|Page(s)||181 - 193|
|Published online||11 March 2013|
Cutwidth of iterated caterpillars∗
School of Electronics and Information Engineering, Tongji
2 The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China
3 Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China
Accepted: 19 December 2012
The cutwidth is an important graph-invariant in circuit layout designs. The cutwidth of a graph G is the minimum value of the maximum number of overlap edges when G is embedded into a line. A caterpillar is a tree which yields a path when all its leaves are removed. An iterated caterpillar is a tree which yields a caterpillar when all its leaves are removed. In this paper we present an exact formula for the cutwidth of the iterated caterpillars.
Mathematics Subject Classification: 05C78 / 68M10 / 68R10
Key words: Circuit layout design / graph labeling / cutwidth / caterpillar / iterated caterpillar
© EDP Sciences 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.