688 search results - page 31 / 138 » General Partitioning on Random Graphs |
123
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
102
click to vote
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
116
Voted
JCO
2008
15 years 10 days ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
84
Voted
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
101
Voted
TPDS
2002
15 years 6 hour ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...