4865 search results - page 625 / 973 » The Complexity of Graph Connectivity |
170
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
181
Voted
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...
196
Voted
HICSS
2010
IEEE
16 years 1 months ago
2010
IEEE
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
219
click to vote
PLDI
2004
ACM
16 years 5 days ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
167
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...