Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski. Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica, 27(3):337-347, 2000. [doi]
@article{DessmarkLP00:0,
title = {Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees},
author = {Anders Dessmark and Andrzej Lingas and Andrzej Proskurowski},
year = {2000},
url = {http://link.springer.de/link/service/journals/00453/contents/00/10023/},
researchr = {https://researchr.org/publication/DessmarkLP00%3A0},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {337-347},
}