1951 search results - page 175 / 391 » An algorithm for improving graph partitions |
119
Voted
DM
2008
15 years 5 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
190
click to vote
SIGMOD
2011
ACM
14 years 7 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 ...
132
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
151
click to vote
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
164
click to vote
PPOPP
2012
ACM
14 years 18 days ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...