Author:
Kriege Nils M.,Seidel Thomas,Humbeck Lina,Lessel Uta
Reference129 articles.
1. Maximum common induced subgraph parameterized by vertex cover;Abu-Khzam;Information Processing Letters,2014
2. On the complexity of various parameterizations of common induced subgraph isomorphism;Abu-Khzam;Theoretical Computer Science,2017
3. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree;Akutsu;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,1993
4. Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree;Akutsu;International Journal of Foundations of Computer Science,2020
5. On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree;Akutsu,2012