Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Induced subgraph isomorphism problem (view)

searching for Subgraph isomorphism problem 5 found (24 total)

alternate case: subgraph isomorphism problem

Maximum common subgraph (97 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, a maximum common subgraph may mean either: Maximum common induced subgraph, a graph that is an induced

Color-coding (1,988 words) [view diff] exact match in snippet view article find links to article

cycles of a given length, and more generally it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms

Grundy number (1,355 words) [view diff] case mismatch in snippet view article find links to article

Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The Subgraph Isomorphism Problem and Boolean Queries", Sparsity: Graphs, Structures, and Algorithms

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] exact match in snippet view article find links to article

has a subgraph isomorphic to any given graph (the so-called subgraph isomorphism problem), the best known lower bound is Ω ( n 3 / 2 ) {\displaystyle

Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article

crossing number is zero. As a consequence of bounded expansion, the subgraph isomorphism problem, of finding whether a pattern graph of bounded size exists as