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 network problem with side constraints. We propose an algorithm for solving our problem based on the generic version of the preflow-push algorithm for the maximum flow network problem. Also, our algorithm incorporates heuristic approaches to generate close to optimal solutions which are also feasible with regards to the side capacity constraints.
Computer Sciences | Management Information Systems
Information Systems and Management
International Conference on Optimization: Techniques and Applications (ICOTA92)
Phua, K. H.; et al
City or Country
HUM, Sin Hoon and LEONG, Thin Yin.
A Weighted Graph Partitioning Problem with Side Constraints. (1992). International Conference on Optimization: Techniques and Applications (ICOTA92). 235-240. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1599
This document is currently not available here.