… through graph data structures. Thus, the task of finding similar parts is simplified to solve
the problem of subgraph matching or subgraph isomorphism. Each node of the graph is …

… the computations through rowwise or columnwise decomposition of an m*m square … graph
model is suitable for the partitioning of nonsymmetric matrices. We need more powerful graph …

… , the generation and decomposition of attributed adjacency graph, and the discrimination of
… A new methodology for extracting manufacturing features from CAD system[J]. Computers & …

… graph structure to generate a heterogeneous graph. Then, we design two meta-paths to
decompose the heterogeneous graph into two isomorphic graphs, and put them into a two-level …

… and top down filter and uses data structure——graph to store datasets, infrequent item sets
to split moving pattern graph, and long moving pattern to filter data sets strategy, and then the …

… components), KWS(keyword search)和ISO(subgraph isomorphism),并提出了针对这4 种图查询
… An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc. of …

… Graph embedding is an efficient method for graph analysis. It converts original graph data into
a low-… Different from previous studies, this paper focuses on both static and dynamic graph …

… method, which is essential to our analyses, is a new method we … decomposition theorem
which states the conditions under which the persistence module can be decomposed …

… spectral theorem and update their parameters by signal filtering in spectral domain with
designed filters. However,eigendecomposition of graph shift operator is costly for large graphs …

… This kind of balanced decomposition is crucial when we seek … technique to the two
subpolygons thus formed, we will obtain a tree S which forms a balanced hierarchical decomposition …