Back to Search
Start Over
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning.
- Source :
-
IEEE Transactions on Computers . Apr99, Vol. 48 Issue 4, p361. 25p. 2 Black and White Photographs, 1 Diagram, 17 Charts, 5 Graphs. - Publication Year :
- 1999
-
Abstract
- Proposes the heuristic algorithms for the Graph Partitioning problem. Areas of computer science where the partitioning problem arise; Test beds and experimental setup; Details on the greedy construction algorithm for the problem; Prohibition-based search; Fixed-Tabu Search (TS) for graph partitioning; Randomized prohibition; Conclusions.
- Subjects :
- *ALGORITHMS
*GRAPH theory
*HEURISTIC
Subjects
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 48
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 1807337
- Full Text :
- https://doi.org/10.1109/12.762522