Sciweavers

1132 search results - page 3 / 227
» Similarity Graphs
Sort
View
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 7 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 11 days ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
JMLR
2006
97views more  JMLR 2006»
13 years 5 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
ENDM
2008
93views more  ENDM 2008»
13 years 5 months ago
On Universal Graphs of Minor Closed Families
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
Arnaud Labourel
BPM
2009
Springer
138views Business» more  BPM 2009»
14 years 6 days ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...