Marc Hellmuth

Exact Enumeration of All Connected Maximum Common Subgraphs in Multiple Labeled Graphs: Application to Cheminformatics

We present an exact algorithmic framework for enumerating all maximum common subgraphs shared by multiple vertex- and edgelabeled graphs, motivated by molecular-graph comparison in cheminformatics and computational chemistry and, more generally, by comparison problems on labeled networks. The framework addresses maximu...