VF2++ -- an improved subgraph isomorphism algorithm
DOI10.1016/J.DAM.2018.02.018zbMATH Open1384.05146OpenAlexW2795196889WikidataQ130048644 ScholiaQ130048644MaRDI QIDQ1744243FDOQ1744243
Authors: Alpár Jüttner, Péter Madarasi 
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
Recommendations
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)
Cites Work
- An Algorithm for Subgraph Isomorphism
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On testing isomorphism of permutation graphs
- AllDifferent-based filtering for subgraph isomorphism
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Colored hypergraph isomorphism is fixed parameter tractable
Cited In (6)
- Efficient Suboptimal Graph Isomorphism
- Indexing with well-founded total order for faster subgraph isomorphism detection
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- VF2++
- SLF: a passive parallelization of subgraph isomorphism
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
Uses Software
This page was built for publication: VF2++ -- an improved subgraph isomorphism algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744243)
