Feedback Vertex Set and Longest Induced Path on AT-Free Graphs

Dieter Kratsch, Haiko Müller, Ioan Todinca. Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. In Hans Leo Bodlaender, editor, Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers. Volume 2880 of Lecture Notes in Computer Science, pages 309-321, Springer, 2003. [doi]

@inproceedings{KratschMT03,
  title = {Feedback Vertex Set and Longest Induced Path on AT-Free Graphs},
  author = {Dieter Kratsch and Haiko Müller and Ioan Todinca},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2880&spage=309},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KratschMT03},
  cites = {0},
  citedby = {0},
  pages = {309-321},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
  editor = {Hans Leo Bodlaender},
  volume = {2880},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20452-0},
}