Pages that link to "Item:Q606895"
From MaRDI portal
The following pages link to Solving subgraph isomorphism problems with constraint programming (Q606895):
Displaying 14 items.
- On the subgraph epimorphism problem (Q741740) (← links)
- AllDifferent-based filtering for subgraph isomorphism (Q991022) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- Finding subgraphs with side constraints (Q2117235) (← links)
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs (Q2195978) (← links)
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs (Q2212077) (← links)
- (Q4511277) (← links)
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants (Q5100743) (← links)
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism (Q5406228) (← links)
- An Algorithm Portfolio for the Sub-graph Isomorphism Problem (Q5429292) (← links)
- SLF: a passive parallelization of subgraph isomorphism (Q6492611) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)