Hans Leo Bodlaender, Ton Kloks. Better Algorithms for the Pathwidth and Treewidth of Graphs. In Javier Leach Albert, Burkhard Monien, Mario RodrÃguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings. Volume 510 of Lecture Notes in Computer Science, pages 544-555, Springer, 1991.
@inproceedings{BodlaenderK91, title = {Better Algorithms for the Pathwidth and Treewidth of Graphs}, author = {Hans Leo Bodlaender and Ton Kloks}, year = {1991}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/BodlaenderK91}, cites = {0}, citedby = {0}, pages = {544-555}, booktitle = {Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings}, editor = {Javier Leach Albert and Burkhard Monien and Mario RodrÃguez-Artalejo}, volume = {510}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-54233-7}, }