5607 search results - page 414 / 1122 » Graph structure in the Web |
172
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
198
click to vote
FLAIRS
2004
15 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
140
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
180
click to vote
ARSCOM
2007
15 years 7 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
174
click to vote
ENTCS
2008
15 years 7 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...