Results 271 to 273 of about 768,033 (273)

Star partitions on graphs

Discrete Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini   +3 more
openaire   +2 more sources

The Optimal Partitioning of Graphs

SIAM Journal on Applied Mathematics, 1976
The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can contain. This is a special case of the general partitioning problem of a graph into k parts with size constraints, which appears in a number of very diverse
Christofides, Nicos, Brooker, P.
openaire   +1 more source

Hierarchical graph partitioning

Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
One of the important optimization questions in highly parallel systems is the problem of assigning computational resources to communicating tasks. While scheduling tasks/operators, tasks assigned to nearby resources (e.g. on the same CPU core) have low communication costs, whereas tasks assigned to distant resources (e.g.
Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha   +3 more
openaire   +1 more source