Unsolved problem in computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph isomorphism...

called an isomorphism class of graphs. The question of whether graph isomorphism can be determined in polynomial time is a major unsolved problem in computer...

theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle H}...

Isomorphism problem may refer to: graph isomorphism problem group isomorphism problem isomorphism problem of Coxeter groups This disambiguation page lists...

of a list of generators, is polynomial-time equivalent to the graph isomorphism problem, and therefore solvable in quasi-polynomial time, that is with...

In graph theory, the Weisfeiler Leman graph isomorphism test is a heuristic test for the existence of an isomorphism between two graphs G and H. It is...

NP-intermediate problems. The graph isomorphism problem, the discrete logarithm problem, and the integer factorization problem are examples of problems believed...

called the clique problem (NP-complete). One special case of subgraph isomorphism is the graph isomorphism problem. It asks whether two graphs are isomorphic...

satisfiability problems cannot be in NPI. Some problems that are considered good candidates for being NP-intermediate are the graph isomorphism problem, and decision...

quantum computer? Can the graph isomorphism problem be solved in polynomial time on a classical computer? The graph isomorphism problem involves determining...

and the model graph. The case of exact graph matching is known as the graph isomorphism problem. The problem of exact matching of a graph to a part of...

captures problems such as factoring, discrete logarithm, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory...

isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups. The isomorphism problem...

example is the graph isomorphism problem, the graph theory problem of determining whether a graph isomorphism exists between two graphs. Two graphs are isomorphic...

in 2017. abstract We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset...

graph coloring problems, since other coloring problems can be transformed into a vertex coloring instance. For example, an edge coloring of a graph is...

Clearly, the graph canonization problem is at least as computationally hard as the graph isomorphism problem. In fact, graph isomorphism is even AC0-reducible...

-complete problem is NP-hard. Similarly, the complexity class GI consists of the problems that can be reduced to the graph isomorphism problem. Since graph isomorphism...

constitutes a graph isomorphism. Fractional isomorphism is the coarsest of several different relaxations of graph isomorphism. Whereas the graph isomorphism problem...

In graph theory, two graphs G {\displaystyle G} and G ′ {\displaystyle G'} are homeomorphic if there is a graph isomorphism from some subdivision of G...

the graph isomorphism problem. However, it is also possible to translate these problems in the opposite direction, showing that polytope isomorphism testing...

Such problems are called NP-intermediate problems. The graph isomorphism problem, the discrete logarithm problem and the integer factorization problem are...

checking whether a given graph is self-complementary are polynomial-time equivalent to the general graph isomorphism problem. Sachs, Horst (1962), "Über...

showed, the problem of recognizing whether a graph is a lexicographic product is equivalent in complexity to the graph isomorphism problem. The lexicographic...

S2CID 119151552. Klin, M. H., M. Muzychuk and R. Poschel: The isomorphism problem for circulant graphs via Schur ring theory, Codes and Association Schemes, American...

showed that the graph nonisomorphism problem, the complement of the graph isomorphism problem, has a zero-knowledge proof. This problem is in co-NP, but...

matching. Finding a matching in a bipartite graph can be treated as a network flow problem. Given a graph G = (V, E), a matching M in G is a set of pairwise...

polynomial of a graph. Easily computable graph invariants are instrumental for fast recognition of graph isomorphism, or rather non-isomorphism, since for...

of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u...

Subgroup Problem with Polynomial Space". arXiv:quant-ph/0406151v1. Grohe, Martin; Neuen, Daniel (2021). "Recent advances on the graph isomorphism problem". In...