1, The induced spanning subgraph was employed in studying the property of the graph of decomposable tensor.

2, Although Subgraph Isomorphism problem is known to be NP-complete, our solution is very fast in practice for real circuits.

3, A generalization of the problem, the subgraph isomorphism problem, is known to be NP - complete.

4, The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex.

5, Then place an osg: Camera above the subgraph to create an orthographic projection.

6, We call such a spanning subgraph T an economical spanning subgraph.

7, GString is a subgraph search algorithm designed for chemical compound structure database.

8, G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching.

9, This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism,(http:///subgraph.html) and also proposes a novel method to extract subword parallelism based on the cost subgraph.

10, G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G.

11, This paper studies uncertain graph data mining and especially investigates the problem of mining frequent subgraph patterns from uncertain graph data.

12, The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.

13, The main contributions are as follows:Firstly, a novel scale-free network model based on clique (complete subgraph of random size) growth and preferential attachment is proposed.

14, All conceptions , including Content DataModel ( CDM ) , Data Dependency Graph ( DDG ) and Data Update Subgraph ( DUS ) are defined.

15, We propose the definition of approximate acceptance with which we discuss the nonuniform complexity of the K sized complete subgraph problem.

16, A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.

17, In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.

18, Finally, we repeat the above phases until no more dense subgraph can be found.

19, The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.

20, On the other hand, We obtain the statement that the quasi-independence graph of a decomposed component is the same as Itself induced subgraph.

21, The contribution of this paper includes: Firstly, a measurement model has been proposed by researching the search space of subgraph isomorphism algorithm.