Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski. Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. In Josep Díaz, Maria J. Serna, editors, Algorithms - ESA 96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings. Volume 1136 of Lecture Notes in Computer Science, pages 501-513, Springer, 1996.

@inproceedings{DessmarkLP96,
  title = {Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees},
  author = {Anders Dessmark and Andrzej Lingas and Andrzej Proskurowski},
  year = {1996},
  researchr = {https://researchr.org/publication/DessmarkLP96},
  cites = {0},
  citedby = {0},
  pages = {501-513},
  booktitle = {Algorithms - ESA  96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings},
  editor = {Josep Díaz and Maria J. Serna},
  volume = {1136},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61680-2},
}