On the complexity of various parameterizations of common induced subgraph isomorphism-Reference-Cited by-同舟云学术

On the complexity of various parameterizations of common induced subgraph isomorphism

Published:2017-10 Issue: Volume:697 Page:69-78
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Abu-Khzam Faisal N.,Bonnet Édouard,Sikora Florian

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. Maximum common induced subgraph parameterized by vertex cover;Abu-Khzam;Inform. Process. Lett.,2014

2. On the complexity of various parameterizations of common induced subgraph isomorphism;Abu-Khzam,2014

3. An RNC algorithm for finding a largest common subtree of two trees;Akutsu;IEICE Trans. Inf. Syst.,1992

4. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree;Akutsu;IEICE Trans. Fundam. Electron. Commun. Comput. Sci.,1993

5. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs;Alon;Algorithmica,2009

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Chemical Similarity and Substructure Searches;Reference Module in Life Sciences;2024

2. Streaming deletion problems parameterized by vertex cover;Theoretical Computer Science;2023-11

3. Streaming Deletion Problems Parameterized by Vertex Cover;Fundamentals of Computation Theory;2021

4. Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree;International Journal of Foundations of Computer Science;2020-02

5. A genetic approach to the maximum common subgraph problem;Proceedings of the 20th International Conference on Computer Systems and Technologies;2019-06-21