@inproceedings{84a6530418504a528d9b3e01a95b33e3,
title = "An NC algorithm for finding minimum weighted completion time schedule on series parallel graphs",
abstract = "We present a parallel algorithm for solving the minimum weighted completion time scheduling problem for transitive series parallel graphs. The algorithm takes 0(log* n) time with 0 (n3 ) processors on a CREW PRAM, where n is the number of vertices of the input graph. This is the first NC aigorithmfor solving the problem.",
author = "S. Sunder and Xin He",
note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992 ; Conference date: 01-12-1992 Through 04-12-1992",
year = "1992",
doi = "10.1109/SPDP.1992.242754",
language = "English",
series = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "120--127",
booktitle = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",
address = "United States",
}