Colored Multiway cuts in Generalized Tree Networks

摘要：

Given a graph with color dependent edge weights and a partial coloration on some distinguished vertices, the colored multiway cut problem is to extend the partial coloration such that all the vertices are colored and the total weight of edges that have different colored endpoints is minimized. A polynomial time algorithm is presented that solves the problem exactly for generalized tree networks.

关键词： algorithms colored multiway cuts generalized tree networks

作者: Xin Xiao Li Shuguang

作者单位: College of Foreign Studies Shandong Institute of Business and Technology Yantai, China College of Computer Science and Technology Shandong Institute of Business and Technology Yantai, Chi

会议类型: 国际会议

会议名称: 2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

会议地点: 太原

会议语种:英文

页码: 299-301

在线出版日期: 2009-07-10（万方平台首次上网日期，不代表论文的发表时间）