Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals E76-A(9) (1993)
2. Lecture Notes in Computer Science;T. Akutsu,2012
3. Akutsu, T., Tamura, T.: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree. Algorithms 6(1), 119–135 (2013)
4. Bachl, S., Brandenburg, F.J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms Appl. 8(2), 215–238 (2004)
5. Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica 27, 337–347 (2000)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献