Sciweavers

172 search results - page 15 / 35
» The Analysis of a List-Coloring Algorithm on a Random Graph
Sort
View
142
Voted
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 21 days ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
138
Voted
COMPLEX
2009
Springer
15 years 6 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
128
Voted
WEBI
2005
Springer
15 years 8 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
139
Voted
ECCC
2000
93views more  ECCC 2000»
15 years 2 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
WWW
2011
ACM
14 years 9 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh