796 search results - page 50 / 160 » Graph Properties Based Filtering |
122
click to vote
SDM
2010
SIAM
15 years 3 months ago
2010
SIAM
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
114
click to vote
JDA
2010
15 years 28 days ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
116
click to vote
MICS
2010
14 years 9 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
CP
2003
Springer
15 years 7 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
121
click to vote
SEMWEB
2005
Springer
15 years 8 months ago
2005
Springer
We propose a declarative update language for RDF graphs which is based on the paradigms of query and view languages RQL and RVL. Our language, called RUL, ensures that the executio...