5606 search results - page 10 / 1122 » Randomization Techniques for Graphs. |
FSTTCS
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
SLS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
AVI
2006
13 years 9 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...