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...

Full description

Saved in:
Bibliographic Details
Main Authors: HUM, Sin Hoon, LEONG, Thin Yin
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
Be the first to leave a comment!
You must be logged in first