1940 search results - page 94 / 388 » Graph Transformation with Variables |
103
click to vote
GG
2008
Springer
15 years 4 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
111
click to vote
AEI
2008
15 years 3 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
124
click to vote
CSR
2008
Springer
15 years 5 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, ...
139
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
102
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...