Two-stage \(m\)-way graph partitioning

DOI10.1016/0167-8191(93)90081-UzbMath0797.68022OpenAlexW2073684463MaRDI QIDQ1318559

V. Pereyra

Publication date: 10 April 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90081-u

zbMATH Keywords

performanceclusteringgraph partitioningundirected graphtask assignmenttask allocationdesign automationdistributed processorsKernighan-Lin heuristcUDG

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION

This page was built for publication: Two-stage \(m\)-way graph partitioning