An improved maximum common induced subgraph solver

MaRDI QIDQ5165142zbMATH OpenFDO

Authors Matjaž Depolli, Sándor Szabó, Bogdán Zaválnij

Publication date 15 November 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match84/n1/match84n1_7-28.pdf

Mathematics Subject Classification ID

Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Computing and Combinatorics
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
• scientific article; zbMATH DE number 2043361
• Finding maximal common subgraphs via time-space efficient reverse search
• Polyhedral study of the maximum common induced subgraph problem

Cited in

(4)

• Finding maximal common subgraphs via time-space efficient reverse search
• A fast discovery algorithm for large common connected induced subgraphs
• Common object discovery as local search for maximum weight cliques in a global object similarity graph
• Computing and Combinatorics

This page was built for publication: An improved maximum common induced subgraph solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165142)