Heuristics for graph decomposition
The problem addressed in this paper is that of decomposing a weighted graph into a specified number of subgraphs such that these subgraphs have balanced sums of vertex weights and minimal sums of edge weights. To find a reasonable solution to this intractable problem, we suggest an approximate objec...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Published: |
2000
|
| Online Access: | http://hdl.handle.net/10725/7909 http://dx.doi.org/10.1109/ICECS.2000.912961 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/912961/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!