In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must...

efficiently. This problem is a special case of the subgraph isomorphism problem, which asks whether a given graph G contains a subgraph that is isomorphic...

graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph...

the induced subgraph of all vertices adjacent to it. The induced subgraph isomorphism problem is a form of the subgraph isomorphism problem in which the...

problems: Graph Isomorphism: Is graph G1 isomorphic to graph G2? Subgraph Isomorphism: Is graph G1 isomorphic to a subgraph of graph G2? The Subgraph...

Maximum bipartite subgraph or (especially with weighted edges) maximum cut.: GT25, ND16  Maximum common subgraph isomorphism problem: GT49  Maximum independent...

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...

of vertices. Maximum common subgraph isomorphism problem Subgraph isomorphism problem Induced subgraph isomorphism problem Bahiense, L.; Manic, G.; Piva...

computer science, a maximum common subgraph may mean either: Maximum common induced subgraph, a graph that is an induced subgraph of two given graphs and has...

NP-complete problem. For example: Finding the largest complete subgraph is called the clique problem (NP-complete). One special case of subgraph isomorphism is...

with at least k vertices. This problem is NP-complete. It is a generalization of the induced subgraph isomorphism problem, which arises when k equals the...

(a polynomial number of times). The subgraph isomorphism problem of determining whether graph G contains a subgraph that is isomorphic to graph H. Turing...

the graph isomorphism problem. The problem of exact matching of a graph to a part of another graph is called subgraph isomorphism problem. Inexact graph...

it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms when the subgraph pattern that it is...

occurrence of the pattern graph (pattern matching, thus solving the subgraph isomorphism problem) and by replacing the found occurrence by an instance of the...

to isomorphism. It can be represented as an induced subgraph of G, and is a core in the sense that all of its self-homomorphisms are isomorphisms. 4.  In...

whether a graph is uniquely determined by its vertex-deleted subgraphs. The snake-in-the-box problem: what is the longest possible induced path in an n {\displaystyle...

clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph...

with these properties have efficient algorithms for problems including the subgraph isomorphism problem and model checking for the first order theory of...

induced subgraph isomorphism problem. There is a similar problem of finding long induced cycles in hypercubes, called the coil-in-the-box problem. The snake-in-the-box...

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G {\displaystyle G} , find the maximal number of edges...

{\displaystyle u} . The subgraph isomorphism problem for a fixed subgraph H {\displaystyle H} asks whether H {\displaystyle H} appears as a subgraph of a larger graph...

to isomorphisms of induced subgraphs of G and H. Therefore, the modular product graph can be used to reduce problems of induced subgraph isomorphism to...

Unsolved problem in mathematics: Are graphs uniquely determined by their subgraphs? (more unsolved problems in mathematics) Informally, the reconstruction...

Determining whether for graphs G and H, H is homeomorphic to a subgraph of G, is an NP-complete problem. The reverse operation, smoothing out or smoothing a vertex...

removes them from the graph. These actions are repeated on the remaining subgraph until no vertices remain. The worst-case complexity of DSatur is O ( n...

Kosaraju's algorithm Tarjan's strongly connected components algorithm Subgraph isomorphism problem Bitap algorithm: fuzzy algorithm that determines if strings are...

invariants are instrumental for fast recognition of graph isomorphism, or rather non-isomorphism, since for any invariant at all, two graphs with different...

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

bounded expansion, the subgraph isomorphism problem, of finding whether a pattern graph of bounded size exists as a subgraph of a larger graph, can be...