Pages that link to "Item:Q5122158"
From MaRDI portal
The following pages link to GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM (Q5122158):
Displaying 13 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Two-closures of supersolvable permutation groups in polynomial time (Q777912) (← links)
- On the asymmetric complexity of the group-intersection problem (Q963437) (← links)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture (Q1984524) (← links)
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs (Q2030268) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- On the WL-dimension of circulant graphs of prime power order (Q6119507) (← links)
- On multidimensional Schur rings of finite groups (Q6146256) (← links)
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating (Q6158565) (← links)
- The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
- Linear Representation of Graphs: Applications to Molecular Graphs (Q6167496) (← links)
- On the Weisfeiler-Leman dimension of permutation graphs (Q6561325) (← links)
