Sciweavers

543 search results - page 12 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
JCT
2008
109views more  JCT 2008»
13 years 8 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 13 days ago
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchi...
PARA
2004
Springer
14 years 1 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
JPDC
1998
124views more  JPDC 1998»
13 years 7 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
ATAL
2005
Springer
14 years 1 months ago
Data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
Filip Miletic, Patrick Dewilde