543 search results - page 10 / 109 » A Multiagent Algorithm for Graph Partitioning |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
NETWORKS
2010
13 years 6 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
SIES
2007
IEEE
14 years 2 months ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: