The following pages link to Graph isomorphism problem (Q1057883):
Displaying 27 items.
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- A term equality problem equivalent to graph isomorphism (Q1332775) (← links)
- Isomorphic unordered labeled trees up to substitution ciphering (Q2115877) (← links)
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism'' (Q2282762) (← links)
- Binets: fundamental building blocks for phylogenetic networks (Q2359132) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Almost equitable partitions and controllability of leader-follower multi-agent systems (Q2665380) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Permutation Groups and the Graph Isomorphism Problem (Q2821703) (← links)
- Isomorphism of (mis)Labeled Graphs (Q3092245) (← links)
- Some recognition problems related to graph isomorphism (Q3470503) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- (Q4435132) (← links)
- (Q5089162) (← links)
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM (Q5122158) (← links)
- Lorentzian spectral geometry with causal sets (Q5162473) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)
- Homomorphically full oriented graphs (Q6599797) (← links)
