@inproceedings{12f90ab50f2748728a0762cd462fb496,
title = "Divide-and-conquer minimal-cut bisectioning of task graphs",
abstract = "This paper proposes a method for partitioning the vertex set of an undirected simple weighted graph into two subsets so as to minimise the difference of vertex-weight sums between the two subsets and the total weight of edges cut (i.e., edges with one end in each subset). The proposed heuristic algorithm works in a divide-and-conquer fashion and is a modification of an algorithm suggested in the literature. The algorithm has the same time complexity as the previous one but is extended to work on weighted graphs.",
author = "S. Lor and Hong Shen and P. Maheshwari",
note = "Publisher Copyright: {\textcopyright} 1994 IEEE.; 1st International Conference on Massively Parallel Computing Systems: The Challenges of General-Purpose and Special-Purpose Computing, MPCS 1994 ; Conference date: 02-05-1994 Through 06-05-1994",
year = "1994",
doi = "10.1109/MPCS.1994.367082",
language = "English",
series = "MPCS 1994 - 1st International Conference on Massively Parallel Computing Systems: The Challenges of General-Purpose and Special-Purpose Computing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "155--162",
booktitle = "MPCS 1994 - 1st International Conference on Massively Parallel Computing Systems",
address = "United States",
}