40 search results - page 7 / 8 » A Relational View of Subgraph Isomorphism |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
DIAGRAMS
2004
Springer
14 years 1 months ago
2004
Springer
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
GD
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...