Pages that link to "Item:Q4639034"
From MaRDI portal
The following pages link to When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (Q4639034):
Displaying 5 items.
- Isomorphisms between random graphs (Q2692783) (← links)
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants (Q5100743) (← links)
- Subgraph matching on temporal graphs (Q6089960) (← links)
- G-Morph: Induced Subgraph Isomorphism Search of Labeled Graphs on a GPU (Q6487196) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)