Gary, Naveen, Vijay V. Vazirani, and Mihalis Yannakakis. Multiway Cuts in Directed and Node Weighted Graphs. Proceedings of the 21st International Colloquim on Automata, Languages, and Programming (ICALP), pp. 487-498. Jerusalem, Isreal, July 1994. Springer-Verlag. 14  Home/Search   Document Not in Database   Summary   Related Articles

....execution. The lift to front min cut algorithm, in our current implementation, can produce only two machine, client server applications. The problem of partitioning applications across three or more machines is provably NP hard [13] Numerous heuristic algorithms exist for multi way graph cutting [7, 10, 12, 33, 38]. To more accurately evaluate the rest of the system, we restrict ourselves to an exact, two way algorithm for clientserver computing. After analysis, the application s ICC graph and component classification data (to be described later) are written into the configuration record in the application ....

Gary, Naveen, Vijay V. Vazirani, and Mihalis Yannakakis. Multiway Cuts in Directed and Node Weighted Graphs. Proceedings of the 21st International Colloquim on Automata, Languages, and Programming (ICALP), pp. 487-498. Jerusalem, Isreal, July 1994. Springer-Verlag. 14

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC