Linear rank-width and linear clique-width of trees

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

Metadata

Authors/Creators:
  • Adler, I
  • Kante, MM
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:
  • Published: 19 July 2015
  • Accepted: 13 April 2015
  • Published (online): 21 April 2015
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (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: https://doi.org/10.1016/j.tcs.2015.04.021
Related URLs:

Share / Export

Statistics