2314 search results - page 113 / 463 » Minimal Partitions of a Graph |
98
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
128
Voted
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
163
Voted
JMLR
2008
15 years 3 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
130
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
143
Voted
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we propose a new multi-objective multilevel K-way partitioning which is aware of resource utilization distribution, assuming the resource utilization for a partitio...