Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Graph isomorphism problem (view), Fractional graph isomorphism (view), Weisfeiler Leman graph isomorphism test (view), Subgraph isomorphism problem (view)

searching for Graph isomorphism 19 found (112 total)

alternate case: graph isomorphism

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

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

Strongly chordal graph (1,167 words) [view diff] exact match in snippet view article find links to article

Steiner Tree can be solved efficiently for strongly chordal graphs. Graph isomorphism is isomorphism-complete for strongly chordal graphs. Hamiltonian Circuit

Anna Lubiw (544 words) [view diff] exact match in snippet view article find links to article

scientist. Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism", SIAM Journal on Computing, 10 (1): 11–21, doi:10.1137/0210002, MR 0605600

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

Co-NP (964 words) [view diff] case mismatch in snippet view article find links to article

1007/978-3-319-32162-2_1. ISBN 9783319321622. See Section 2.2.4 Factoring and Graph Isomorphism, pp. 19–20 of book (pp. 17–18 of linked version). Complexity Zoo:

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

in a crystal. One of the more popular classification criteria is graph isomorphism, not to be confused with crystallographic isomorphism. Two periodic

Parity P (468 words) [view diff] exact match in snippet view article find links to article

v005a007 Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1992), "Graph isomorphism is low for PP", Computational Complexity, 2 (4): 301–330, doi:10.1007/BF01200427

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

Jingbo B. (2011). "Two-particle quantum walks: Entanglement and graph isomorphism testing". Physical Review A. 83 (4): 042317. Bibcode:2011PhRvA..83d2317B

László Pyber (677 words) [view diff] case mismatch in snippet view article find links to article

Genealogy Project". "Akadémiai Díj". February 2016. "Growth in Groups and Graph Isomorphism Now". Pyber, László (1985). "An Erdös-Gallai conjecture". Combinatorica

Sergei Evdokimov (963 words) [view diff] exact match in snippet view article find links to article

number of algorithms (which became already classical) for testing graph isomorphism were constructed. In the last years of his life, Sergei became also

Feedback vertex set (1,805 words) [view diff] exact match in snippet view article find links to article

polynomial time for graphs with bounded FVS number. Some examples are graph isomorphism and the path reconfiguration problem. unpublished results due to Garey

Derangement (2,212 words) [view diff] exact match in snippet view article find links to article

December 2011. Lubiw, Anna (1981). "Some NP-complete problems similar to graph isomorphism". SIAM Journal on Computing. 10 (1): 11–21. doi:10.1137/0210002. MR 0605600

Zvi Galil (2,080 words) [view diff] exact match in snippet view article find links to article

several currently-fastest graph algorithms. Examples include trivalent graph isomorphism and minimum weight spanning trees. With his students, Galil devised

Van der Waerden number (1,121 words) [view diff] exact match in snippet view article find links to article

S2CID 122129059. Schweitzer, Pascal (2009). Problems of Unknown Complexity, Graph isomorphism and Ramsey theoretic numbers (Ph.D. thesis). U. des Saarlandes. Karki

Cayley graph (4,692 words) [view diff] exact match in snippet view article find links to article

G=\mathbb {Z} /5\mathbb {Z} } , the symmetric generating sets (up to graph isomorphism) are S = { 1 , 4 } {\displaystyle S=\{1,4\}} : Γ ( G , S ) {\displaystyle

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

Chromatic polynomial (4,325 words) [view diff] exact match in snippet view article find links to article

of the input graph. In practice, branch and bound strategies and graph isomorphism rejection are employed to avoid some recursive calls, the running

Graph coloring (8,446 words) [view diff] exact match in snippet view article find links to article

of the input graph. In practice, branch and bound strategies and graph isomorphism rejection are employed to avoid some recursive calls. The running

Chemical graph generator (5,049 words) [view diff] exact match in snippet view article find links to article

Wikidata Q99233853. Brendan D. McKay; Adolfo Piperno (January 2014). "Practical graph isomorphism, II". Journal of Symbolic Computation. 60: 94–112. doi:10.1016/J.JSC