article · Theoretical Computer Science · 2015

Linear rank-width and linear clique-width of trees

Cited by 17Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Adler, I., & Kanté, M. M. (2015). Linear rank-width and linear clique-width of trees. Theoretical Computer Science, 589, 87–98. https://doi.org/10.1016/j.tcs.2015.04.021

MLA 9

Adler, Isolde, and Mamadou Moustapha Kanté. “Linear rank-width and linear clique-width of trees.” Theoretical Computer Science, vol. 589, 2015, pp. 87–98, https://doi.org/10.1016/j.tcs.2015.04.021.

Chicago

Adler, Isolde, and Mamadou Moustapha Kanté. 2015. “Linear rank-width and linear clique-width of trees.” Theoretical Computer Science 589: 87–98. https://doi.org/10.1016/j.tcs.2015.04.021.

Harvard

Adler, I. and Kanté, M.M. (2015) ‘Linear rank-width and linear clique-width of trees’, Theoretical Computer Science, 589, pp. 87–98. Available at: https://doi.org/10.1016/j.tcs.2015.04.021.

BibTeX

@article{adler2015linear,
  title = {{Linear rank-width and linear clique-width of trees}},
  author = {Adler, Isolde and Kanté, Mamadou Moustapha},
  journal = {Theoretical Computer Science},
  volume = {589},
  pages = {87--98},
  year = {2015},
  doi = {10.1016/j.tcs.2015.04.021}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.