Pages that link to "Item:Q991022"
From MaRDI portal
The following pages link to AllDifferent-based filtering for subgraph isomorphism (Q991022):
Displaying 12 items.
- On the subgraph epimorphism problem (Q741740) (← links)
- An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions (Q830575) (← links)
- An algorithm for weighted sub-graph matching based on gradient flows (Q1671710) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Degree Reduction in Labeled Graph Retrieval (Q2828204) (← links)
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants (Q5100743) (← links)
- Privacy-Preserving Subgraph Matching Protocol for Two Parties (Q5205011) (← links)
- SLF: a passive parallelization of subgraph isomorphism (Q6492611) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)
