4009 search results - page 266 / 802 » Clustering on Complex Graphs |
226
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
218
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
178
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
172
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
130
click to vote
DAM
2006
15 years 6 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...