Sciweavers

1756 search results - page 4 / 352
» Directed scale-free graphs
Sort
View
CONEXT
2008
ACM
13 years 7 months ago
Power-law chord architecture in P2P overlays
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and an efficient resource localization service at...
Salma Ktari, Artur Hecker, Houda Labiod
JDCTA
2010
130views more  JDCTA 2010»
13 years 25 days ago
A Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Dongming Chen, Jing Wang, Xiaodong Chen, Xiaowei X...
INFOCOM
2012
IEEE
11 years 8 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
EDBT
2011
ACM
197views Database» more  EDBT 2011»
12 years 9 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
IOR
2011
175views more  IOR 2011»
13 years 1 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....