Sciweavers

543 search results - page 36 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
COMBINATORICA
2010
13 years 3 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
MOBICOM
2006
ACM
14 years 1 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
GD
2007
Springer
14 years 2 months ago
Multi-circular Layout of Micro/Macro Graphs
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
Michael Baur, Ulrik Brandes
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 2 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
IPPS
1999
IEEE
14 years 8 days ago
Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...