Linear Rank-Width of Distance-Hereditary Graphs

Adler, I, Kante, MM and Kwon, O-J (2014) Linear Rank-Width of Distance-Hereditary Graphs. In: Kratsch, D and Todinca, I, (eds.) Graph-Theoretic Concepts in Computer Science. 40th International Workshop (WG 2014), 25-27 Jun 2014, Nouan-le-Fuzelier, France. Lecture Notes in Computer Science (8747). Springer , pp. 42-55. ISBN 978-3-319-12339-4

Abstract

Metadata

Authors/Creators:
  • Adler, I
  • Kante, MM
  • Kwon, O-J
Copyright, Publisher and Additional Information: © 2014 Springer International Publishing Switzerland. This is an author produced version of a paper published in Lecture Notes in Computer Science. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12340-0_4. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Published: 21 October 2014
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: 12 Oct 2016 08:58
Last Modified: 16 Jan 2018 20:43
Published Version: http://dx.doi.org/10.1007/978-3-319-12340-0_4
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: https://doi.org/10.1007/978-3-319-12340-0_4
Related URLs:

Share / Export

Statistics