Pages that link to "Item:Q1020495"
From MaRDI portal
The following pages link to A parametric filtering algorithm for the graph isomorphism problem (Q1020495):
Displaying 11 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- AllDifferent-based filtering for subgraph isomorphism (Q991022) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Filtering for Subgraph Isomorphism (Q3523085) (← links)
- A Polynomial Algorithm for Submap Isomorphism (Q3637692) (← links)