Adler, I and Kante, MM (2015) Linear rank-width and linear clique-width of trees. Theoretical Computer Science, 589. pp. 87-98. ISSN 0304-3975
Abstract
We show that for every forest T the linear rank-width of T is equal to the path-width of T, and the linear clique-width of T equals the path-width of T plus two, provided that T contains a path of length three. It follows that both linear rank-width and linear clique-width of forests can be computed in linear time. Using our characterization of linear rank-width of forests, we determine the set of minimal excluded acyclic vertex-minors for the class of graphs of linear rank-width at most k.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2015 Elsevier B.V. This is an author produced version of a paper published in Theoretical Computer Science. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Linear rank-width; Linear clique-width; Vertex-minors |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 05 Aug 2016 15:30 |
Last Modified: | 18 Jan 2018 14:25 |
Published Version: | http://dx.doi.org/10.1016/j.tcs.2015.04.021 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.tcs.2015.04.021 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:101098 |