47 search results - page 2 / 10 » Inexact Graph Matching: A Case of Study |
DAM
2010
13 years 4 months ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
ICST
2010
IEEE
13 years 2 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
JCT
2008
13 years 4 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...