DocumentCode
501160
Title
Colored Multiway Cuts in Trees of Rings
Author
Xiao, Xin ; Shuguang, Li
Author_Institution
Coll. of Foreign Studies, Shandong Inst. of Bus. & Technol., Yantai, China
Volume
2
fYear
2009
fDate
15-17 May 2009
Firstpage
236
Lastpage
238
Abstract
The colored multiway cut problem generalizes the traditional multiway cut problem. It is motivated by data partitioning in peer-to-peer networks. A polynomial time algorithm is presented that solves the problem exactly for trees of rings.
Keywords
computational complexity; peer-to-peer computing; telecommunication network routing; colored multiway cut problem; data partitioning; peer-to-peer networks; polynomial time algorithm; trees; Application software; Computer science; Costs; Databases; Educational institutions; Information technology; Partitioning algorithms; Peer to peer computing; Polynomials; Tree graphs; algorithms; multiway cuts; trees of rings;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology and Applications, 2009. IFITA '09. International Forum on
Conference_Location
Chengdu
Print_ISBN
978-0-7695-3600-2
Type
conf
DOI
10.1109/IFITA.2009.491
Filename
5231210
Link To Document