352 search results - page 42 / 71 » Partitioning Graphs into Connected Parts |
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
IFIP12
2007
15 years 1 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
VIP
2003
15 years 1 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
82
Voted
GG
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
RTA
2009
Springer
15 years 6 months ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...