Pages that link to "Item:Q5406228"
From MaRDI portal
The following pages link to Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism (Q5406228):
Displaying 9 items.
- 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)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Sharpening constraint programming approaches for bit-vector theory (Q2011567) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Constraint satisfaction through GBP-guided deliberate bit flipping (Q2175406) (← links)
- Degree reduction in labeled graph retrieval (Q2828204) (← links)
- The Secret Life of Keys: On the Calculation of Mechanical Lock Systems (Q5738136) (← links)