2137 search results - page 256 / 428 » Experiments on Graph Clustering Algorithms |
119
click to vote
IDA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
150
click to vote
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
159
click to vote
PPDP
2010
Springer
15 years 1 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...
137
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
141
click to vote
ASPDAC
2001
ACM
15 years 6 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...