VF2++ -- an improved subgraph isomorphism algorithm

DOI10.1016/j.dam.2018.02.018zbMath1384.05146OpenAlexW2795196889WikidataQ130048644 ScholiaQ130048644MaRDI QIDQ1744243

Péter Madarasi, Alpár Jüttner

Publication date: 20 April 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.018

zbMATH Keywords

computational biologysubgraph isomorphism problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

VF2++

Uses Software

• LEMON

Cites Work

• Unnamed Item
• Unnamed Item
• AllDifferent-based filtering for subgraph isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Colored hypergraph isomorphism is fixed parameter tractable
• On testing isomorphism of permutation graphs
• An Algorithm for Subgraph Isomorphism
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• The complexity of theorem-proving procedures

This page was built for publication: VF2++ -- an improved subgraph isomorphism algorithm