Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

Robert Ganian. Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. In Costas S. Iliopoulos, William F. Smyth, editors, Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Volume 6460 of Lecture Notes in Computer Science, pages 38-42, Springer, 2010. [doi]

@inproceedings{Ganian10,
  title = {Thread Graphs, Linear Rank-Width and Their Algorithmic Applications},
  author = {Robert Ganian},
  year = {2010},
  doi = {10.1007/978-3-642-19222-7_5},
  url = {http://dx.doi.org/10.1007/978-3-642-19222-7_5},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Ganian10},
  cites = {0},
  citedby = {0},
  pages = {38-42},
  booktitle = {Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers},
  editor = {Costas S. Iliopoulos and William F. Smyth},
  volume = {6460},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-19221-0},
}