dc.contributor.author | Marks, Joe | |
dc.contributor.author | Ruml, Wheeler | |
dc.contributor.author | Shieber, Stuart | |
dc.contributor.author | Ngo, J. Thomas | |
dc.date.accessioned | 2008-11-18T19:22:09Z | |
dc.date.issued | 1998 | |
dc.identifier.citation | Joe Marks, Wheeler Ruml, Stuart M. Shieber, and Tom Ngo. A seed-growth heuristic for graph bisection. In R. Battiti and A. A. Bertossi, editors, Proceedings of Algorithms and Experiments '98, pages 76-87, Trento, Italy, February 9-11 1998. | en |
dc.identifier.uri | http://nrs.harvard.edu/urn-3:HUL.InstRepos:2260840 | |
dc.description.abstract | We present a new heuristic algorithm for graph bisection, based on an implicit notion of clustering. We describe how the heuristic can be combined with stochastic search procedures and a postprocess application of the Kernighan-Lin algorithm. In a series of time-equated comparisons with large-sample runs of pure Kernighan-Lin, the new algorithm demonstrates significant superiority in terms of the best bisections found. | en |
dc.description.sponsorship | Engineering and Applied Sciences | en |
dc.language.iso | en_US | en |
dc.relation.isversionof | http://rtm.science.unitn.it/alex98/book/marks.ps.gz | en |
dash.license | LAA | |
dc.title | A seed-growth heuristic for graph bisection | en |
dc.relation.journal | Proceedings of Algorithms and Experiments '98 | en |
dash.depositing.author | Shieber, Stuart | |
dash.identifier.orcid | 0000-0002-7733-8195 | * |
dash.contributor.affiliated | Shieber, Stuart | |