VF2++ -- an improved subgraph isomorphism algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- AllDifferent-based filtering for subgraph isomorphism
- An Algorithm for Subgraph Isomorphism
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Colored hypergraph isomorphism is fixed parameter tractable
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On testing isomorphism of permutation graphs
- The complexity of theorem-proving procedures
Cited in
(6)- Indexing with well-founded total order for faster subgraph isomorphism detection
- Efficient Suboptimal Graph Isomorphism
- SLF: a passive parallelization of subgraph isomorphism
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- VF2++
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
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)