Pages that link to "Item:Q4417659"
From MaRDI portal
The following pages link to A large database of graphs and its use for benchmarking graph isomorphism algorithms (Q4417659):
Displaying 11 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Integer sequence discovery from small graphs (Q908306) (← 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)
- Generalized median graphs and applications (Q2271138) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Formulations for the maximum common edge subgraph problem (Q6193953) (← links)
