On maximum common subgraph problems in series–parallel graphs-Reference-Cited by-同舟云学术

On maximum common subgraph problems in series–parallel graphs

Published:2018-02 Issue: Volume:68 Page:79-95
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Kriege Nils,Kurpicz Florian,Mutzel Petra

Funder

German Research Foundation (DFG)

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference22 articles.

1. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree;Akutsu;IEICE Trans. Fundam.,1993

2. On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree;Akutsu,2012

3. A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree;Akutsu;Algorithms,2013

4. Graph Classes: A Survey;Brandstädt,1999

5. A tighter insertion-based approximation of the crossing number;Chimani,2011

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

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

2. A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph;Discrete Applied Mathematics;2023-10

3. Graph-Based Methods for Rational Drug Design;Lecture Notes in Computer Science;2022

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. Resource-Aware Cache Management for In-Memory Data Analytics Frameworks;2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2019-12