22 search results - page 1 / 5 » Isomorphic Subgraphs |
162
click to vote
JUCS
2008
15 years 5 months ago
2008
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
187
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
173
click to vote
PVLDB
2008
15 years 5 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
180
click to vote
JCP
2008
15 years 5 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
168
Voted
EDBT
2008
ACM
16 years 5 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...