4074 search results - page 270 / 815 » Abstract Graph Transformation |
194
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
138
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
212
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
202
click to vote
HIPC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
166
click to vote
SAMT
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Multimodal and dialogue-based mobile interfaces to the Semantic Web offer access to complex knowledge and information structures. We explore more fine-grained co-ordina...