Sciweavers

5606 search results - page 192 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 10 months 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
103
Voted
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
15 years 6 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
MSWIM
2006
ACM
15 years 6 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
104
Voted
PPL
2000
110views more  PPL 2000»
15 years 14 days ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
COCOON
2007
Springer
15 years 4 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh