Technical Perspective: New Developments in Graph Partitioning.
The article discusses developments in graph partitioning, presenting a review of another article in the issue that surveys developments in approximation algorithms from 1998 to 2008. The author states that graph partitioning played a role in research about algorithms and algorithmic techniques. Topi...
| Published in: | Communications of the ACM Vol. 51; no. 10; pp. 95 - 96 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
Association for Computing Machinery
Oct2008
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| Summary: | The article discusses developments in graph partitioning, presenting a review of another article in the issue that surveys developments in approximation algorithms from 1998 to 2008. The author states that graph partitioning played a role in research about algorithms and algorithmic techniques. Topics include packetrouting in distributed networks, parallel computing architectures and algorithms, and finding an optimal balanced partition. Also discussed are algorithms based on semidefinite programming. |
|---|