Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Subgraph isomorphism problem (view)

searching for Graph isomorphism problem 8 found (49 total)

alternate case: graph isomorphism problem

William Lawrence Kocay (224 words) [view diff] exact match in snippet view article find links to article

mathematical software, the graph reconstruction problem, the graph isomorphism problem, projective geometry, Hamiltonian cycles, planarity, graph embedding

Stathis Zachos (601 words) [view diff] exact match in snippet view article find links to article

interactive proof systems and probabilistic quantifiers, is that the graph isomorphism problem is not likely to be NP-complete (joint with R. Boppana, J. Hastad)

Periodic graph (geometry) (2,096 words) [view diff] exact match in snippet view article

isomorphic, although not necessarily homotopic. Even though the graph isomorphism problem is polynomial time reducible to crystal net topological equivalence

USC-Lockheed Martin Quantum Computing Center (1,094 words) [view diff] exact match in snippet view article find links to article

(2015-06-08). "Experimental quantum annealing: case study involving the graph isomorphism problem". Scientific Reports. 5 (1): 11168. arXiv:1503.06453. Bibcode:2015NatSR

Jingbo Wang (1,129 words) [view diff] exact match in snippet view article find links to article

Brendan L; Wang, Jingbo B (2008). "A classical approach to the graph isomorphism problem using quantum walks". Journal of Physics A: Mathematical and Theoretical

Periodic graph (crystallography) (2,541 words) [view diff] exact match in snippet view article

isomorphism) is readily computed even though, as a subsumption of the graph isomorphism problem, it is apparently computationally difficult in general. It is

Network motif (10,371 words) [view diff] exact match in snippet view article find links to article

classification time of sampled sub-graphs that requires solving the graph isomorphism problem for each sub-graph sample. Additionally, an extra computational

Weisfeiler Leman graph isomorphism test (2,701 words) [view diff] exact match in snippet view article find links to article

therefore the labels. This can be used for kernelization of the graph isomorphism problem. Note that not every map of vertices that respects the labels