543 search results - page 49 / 109 » A Multiagent Algorithm for Graph Partitioning |
ACTA
2008
13 years 8 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
CSE
2009
IEEE
13 years 5 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
DAM
2008
13 years 8 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
APN
2005
Springer
14 years 1 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...