Pages that link to "Item:Q1255944"
From MaRDI portal
The following pages link to Graph isomorphism, general remarks (Q1255944):
Displaying 20 items.
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- A fast isomorphism test for groups whose Lie algebra has genus 2 (Q502735) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- Quantum mechanics on finite groups (Q865105) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Two reductions of graph isomorphism to problems on polynomials (Q1168312) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- Deep graph similarity learning: a survey (Q2036720) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Compatible topologies on graphs: an application to graph isomorphism problem complexity (Q2508982) (← links)
- Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- The complexity of computing the automorphism group of automata and related problems (Q3811719) (← links)
- On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups (Q4983072) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- A Faster Isomorphism Test for Graphs of Small Degree (Q6139827) (← links)
- Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting (Q6150149) (← links)
- The road problem and homomorphisms of directed graphs (Q6175007) (← links)
