Sciweavers

1951 search results - page 5 / 391
» An algorithm for improving graph partitions
Sort
View
JMLR
2012
11 years 11 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
IM
2007
13 years 8 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
JPDC
2008
110views more  JPDC 2008»
13 years 8 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
PPAM
2007
Springer
14 years 2 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot