CP Models for Maximum Common Subgraph Problems-Reference-Cited by-同舟云学术

CP Models for Maximum Common Subgraph Problems

Published:2011 Issue: Volume: Page:637-644
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2011
language:
Short-container-title:

Author:

Ndiaye Samba Ndojh,Solnon Christine

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-23786-7_48

Reference19 articles.

1. Bunke, H., Sharer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19(3), 255–259 (1998)

2. Garey, M.R., Johnson, D.S.: Computer and intractability. Freeman, New York (1979)

3. Régin, J.-C.: Développement d’Outils Algorithmiques pour l’Intelligence Artificielle. Application à la Chimie Organique. PhD thesis, Université Montpellier II (1995)

4. Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computeraided Molecular Design 16(7), 521–533 (2002)

5. Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing 15(4), 1054–1068 (1986)

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

1. Parallel maximal common subgraphs with labels for molecular biology;2024-05-14

2. Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem;Modeling and Analysis of Information Systems;2023-06-14

3. The Multi-Maximum and Quasi-Maximum Common Subgraph Problem;Computation;2023-03-27

4. An Efficient Alternative to Subgraph Isomorphism and Its Advantages;Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence;2022-12-23

5. The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach;Computation;2020-05-18