Maximal Common Subgraph (MCS)
Table of Contents
Maximal Common Subgraph (MCS) #
The Maximal Common Subgraph problem finds the largest subgraph common to two graphs, with applications in molecular matching and pattern discovery.
Recent Literature #
Fast Detection of Maximum Common Subgraph via Deep Q-Learning. Arxiv, 2020. paper
Bai, Yunsheng and Xu, Derek and Wang, Alex and Gu, Ken and Wu, Xueqing and Marinovic, Agustin and Ro, Christopher and Sun, Yizhou and Wang, Wei.
Categories: