Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Multilevel graph partitioning: an evolutionary approach
Date
2005-05-01
Author
Kucupetek, S
Polat, Faruk
Oguztuzun, H
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
2
views
0
downloads
The graph partitioning problem is defined as that of dividing the vertices of an undirected graph into a set of balanced parts through the removal of a set of edges, whose size is to be minimized. A number of researchers have investigated multilevel schemes, which coarsen the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partitioning of the original graph. In this paper, a genetic algorithm for the coarsening phase of a multilevel scheme for graph partitioning is presented. The proposed approach has been demonstrated to improve the solution quality at the expense of running time.
Subject Keywords
Marketing
,
Management Science and Operations Research
,
Strategy and Management
,
Management Information Systems
URI
https://hdl.handle.net/11511/45955
Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
DOI
https://doi.org/10.1057/palgrave.jors.2601837
Collections
Department of Computer Engineering, Article