64 search results - page 7 / 13 » Frequent Subgraph Retrieval in Geometric Graph Databases |
105
click to vote
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
112
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
161
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
EDBT
2008
ACM
15 years 1 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...