318 search results - page 34 / 64 » Distributed Graph Traversals by Relabelling Systems with App... |
INFOVIS
2000
IEEE
14 years 9 days ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
DEBS
2009
ACM
13 years 9 months ago
2009
ACM
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
DKE
2007
13 years 7 months ago
2007
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
KDD
2004
ACM
14 years 1 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...