Author:
Kriege Nils,Kurpicz Florian,Mutzel Petra
Publisher
Springer International Publishing
Reference18 articles.
1. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundam. E76–A(9), 1488–1493 (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. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)
5. Lecture Notes in Computer Science;M Chimani,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献