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: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1992
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/1599 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | 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. |
|---|