Sciweavers

543 search results - page 11 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
JGT
2006
60views more  JGT 2006»
13 years 7 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 8 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 8 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
IPPS
2003
IEEE
14 years 1 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed policies for equitable partitioning: Theory and applications
Abstract— The most widely applied resource allocation strategy is to balance, or equalize, the total workload assigned to each resource. In mobile multi-agent systems, this princ...
Marco Pavone, Emilio Frazzoli, Francesco Bullo