1951 search results - page 314 / 391 » An algorithm for improving graph partitions |
213
click to vote
MSWIM
2006
ACM
16 years 18 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
185
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
170
click to vote
IDEAL
2007
Springer
16 years 24 days ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
175
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
182
click to vote
JUCS
2010
15 years 5 months ago
2010
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...