Sentence examples for induced subgraph from inspiring English sources

In order to design approximation algorithms for MPSM, we also introduce the constrained maximum induced subgraph problem (CMIS) and the constrained minimum induced subgraph (CNIS) problem.

Observe that every (induced) subgraph of a triangulated graph is triangulated.

We prove here that every triangle-free induced subgraph of the triangular lattice is ⌈7k/3⌉-[k]colourable.

We give here an alternative proof of the fact that every triangular-free induced subgraph of the triangular lattice is 5-[2]colourable.

The P4-lite are graphs such that every induced subgraph with at most six vertices either contains at most two P4's or is isomorphic to a spider.

This implies that no odd cycle induced subgraph of length of at least 5 is in Γ ( S M ), which is a contradiction.

Finally, if k>4, then P contains a P5 as induced subgraph.

Let G contain the 2 K2{ x2} x2},{ y1, y2} as induced subgraph.

For each maximal frequent edgeset, a collection of highly-connected subgraphs (k-cliques and percolated k-cliques) is extracted from the induced subgraph within the template graph.

MaWISh (Koyutürk et al., 2006) merged pairwise interaction networks into a single alignment graph and treated network alignment as a maximum weight induced subgraph problem.

Maximum Common Induced Subgraph.