Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T05:19:41.691Z Has data issue: false hasContentIssue false

Cutwidth of iterated caterpillars∗

Published online by Cambridge University Press:  11 March 2013

Lan Lin
Affiliation:
School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China.The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China
Yixun Lin
Affiliation:
Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China. linyixun@zzu.edu.cn

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The cutwidth is an important graph-invariant in circuit layout designs. The cutwidth of agraph G is the minimum value of the maximum number of overlap edges whenG is embedded into a line. A caterpillar is a tree which yields a pathwhen all its leaves are removed. An iterated caterpillar is a tree which yields acaterpillar when all its leaves are removed. In this paper we present an exact formula forthe cutwidth of the iterated caterpillars.

Information

Type
Research Article
Copyright
© EDP Sciences 2013