Sciweavers

139 search results - page 6 / 28
» A New Algorithm for Multi-objective Graph Partitioning
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
JPDC
1998
124views more  JPDC 1998»
14 years 11 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
ANTSW
2004
Springer
15 years 3 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
IJCAI
2007
15 years 1 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 11 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