4 ms·
I created a new algorithm for finding the maximum common subgraph isomorphism (MCS) for a set of N colored graphs (ie, molecules), then extended it to find the
by dalke 13y ago
I created a new algorithm for finding the maximum common subgraph isomorphism (MCS) for a set of N colored graphs (ie, molecules), then extended it to find the MCS which is in at least M of N graphs.
Based on my literature search so far, it can be seen as an improvement on an algorithm from the 1970s. Interestingly, there is an influential paper from around 2000 which rejected the approach, with the hand-waving argument that it would be too slow.