755 search results - page 63 / 151 » Graph Transformation for Topology Modelling |
DC
2002
13 years 8 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...
CSR
2008
Springer
13 years 10 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, ...
IBIS
2006
13 years 8 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 ...
GG
2004
Springer
14 years 2 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 ...
COMPGEOM
2010
ACM
14 years 1 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 ...