731 search results - page 38 / 147 » Reductions to Graph Isomorphism |
PVLDB
2010
13 years 7 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
LICS
1994
IEEE
14 years 23 days ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
ECEASST
2006
13 years 8 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
FM
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...