subgraph

A connected component of a graph G is a maximal connected induced subgraph, that is, a connected induced subgraph that is not itself a proper subgraph of any other connected subgraph of G. Example 7.2 Figure 7.1 is a connected graph.

Recently Uploaded Slideshows 2009

But this graph would violate the Minimality Condition with respect to P, since the subgraph that omits the arrow from X to Y would also satisfy the Markov Condition.

Probabilistic Causation Hitchcock, Christopher 2002

(The graph in Figure 9 is not a subgraph of the graph in Figure 8.)

Probabilistic Causation Hitchcock, Christopher 2002

Note that Figure 8 does satisfy the Minimality Condition; no subgraph satisfies CMC with respect to the described distribution.

Probabilistic Causation Hitchcock, Christopher 2002

The method uses the notion of feature, which can be a small subgraph, subtree or path.

BioMed Central - Latest articles 2010

An explicit chemical reaction $react can be forward or reverse applied once to a molecule $mol at the first subgraph of $mol found which is isomorphic to the substrate or product of

Softpedia - Windows - All Softpedia Linux 2010

Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process.

BioMed Central - Latest articles 2010

Also, an explicit chemical reaction $react can be forward or reverse applied once to a molecule $mol at each subgraph of $mol which is isomorphic to the substrate or product of

Softpedia - Windows - All Softpedia Linux 2010

This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task.

BioMed Central - Latest articles 2010

Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph.

BioMed Central - Latest articles 2010