A Weighted Graph Partitioning Problem with Side Constraints

This paper considers a weighted-graph partitioning problem with side capacity constraints and a special underlying structure: certain nodes are already preassigned to partitions of the graph. We exploit the special underlying structure to make the graph partitioning problem into a maximum flow netwo...

全面介紹

Saved in:
書目詳細資料
Main Authors: HUM, Sin Hoon, LEONG, Thin Yin
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 1992
主題:
在線閱讀:https://ink.library.smu.edu.sg/sis_research/1599
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English