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

extension of subgraph isomorphism known as graph mining is also of interest in that area. Frequent subtree mining Induced subgraph isomorphism problem Maximum...

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

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

path problem, directed and undirected.: GT37, GT38, GT39  Induced subgraph isomorphism problem Graph intersection number: GT59  Longest path problem: ND29 ...

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

possible induced path in a hypercube; it can be viewed as a special case of the induced subgraph isomorphism problem. There is a similar problem of finding...

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

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

isomorphism problem Induced subgraph isomorphism problem Bahiense, L.; Manic, G.; Piva, B.; de Souza, C. C. (2012), "The maximum common edge subgraph...

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

similar problem is finding induced subgraphs in a given graph. Again, some important graph properties are hereditary with respect to induced subgraphs, which...

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

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

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

Z} containing X {\displaystyle X} as an induced subgraph such that every isomorphism between induced subgraphs of X {\displaystyle X} extends to an automorphism...

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

that is not an induced subgraph of a given graph. The exponential time hypothesis also implies that no quasi-polynomial-time problem can be NP-complete...

for induced subgraphs. Roughly speaking, instead of finding a monochromatic subgraph, we are now required to find a monochromatic induced subgraph. In...

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

induced subgraph of a given graph. Other problems for which the best known algorithm takes quasi-polynomial time include: The planted clique problem,...

solve a problem in extremal graph theory, of constructing a graph with a given number of edges and vertices whose largest tree induced as a subgraph is as...

overall graph is a homogeneous graph, meaning that every isomorphism between two of its induced subgraphs can be extended to an automorphism of the whole graph...

constructing their cotrees and applying a linear time isomorphism test for labeled trees. If H is an induced subgraph of a cograph G, then H is itself a cograph;...

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

augmenting path with respect to M. An induced matching is a matching that is the edge set of an induced subgraph. In any graph without isolated vertices...

maximum induced forest (resp. maximum induced directed acyclic graph in the case of directed graphs). Karp (1972) showed that the minimum FVS problem for...

can be used for directed or undirected networks as well as induced or non-induced subgraphs. For more information refer to the provided web links or lab...

graph is defined to be k-ultrahomogeneous if every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism...

analysis. Problems of this type include subgraph isomorphism for subgraphs of bounded size, and the vertex cover and dominating set problems for covers...