745 search results - page 41 / 149 » On Generating Random Network Structures: Connected Graphs |
111
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
120
Voted
PVLDB
2010
14 years 11 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
120
Voted
IM
2007
15 years 12 days ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
ECOOP
2006
Springer
15 years 4 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
87
Voted
SIGMETRICS
2005
ACM
15 years 6 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...