688 search results - page 88 / 138 » General Partitioning on Random Graphs |
94
Voted
EOR
2010
15 years 18 days ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
103
click to vote
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
108
click to vote
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
115
Voted
SOCIALCOM
2010
14 years 10 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
95
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...