755 search results - page 63 / 151 » Graph Transformation for Topology Modelling |
174
click to vote
DC
2002
15 years 5 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
143
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
154
click to vote
IBIS
2006
15 years 5 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
142
click to vote
GG
2004
Springer
15 years 10 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
223
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...