eprintid: 12247
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/22/47
datestamp: 2023-11-10 03:26:47
lastmod: 2023-11-10 03:26:47
status_changed: 2023-11-10 01:17:14
type: article
metadata_visibility: show
creators_name: Rais, H.M.
creators_name: Abed, S.A.
creators_name: Watada, J.
title: Computational comparison of major proposed methods for graph partitioning problem
ispublished: pub
keywords: Computational complexity; Heuristic algorithms; Image segmentation; Simulated annealing; Tabu search, Computational comparisons; Experimental comparison; Graph partitioning problems; High performance computing; Hill climbing; Meta heuristic algorithm; Multilevel approach; State-of-the-art approach, Flow graphs
note: cited By 1
abstract: k-way graph partitioning is an NP-complete problem, which is applied to various tasks such as route planning, image segmentation, community detection, and high-performance computing. The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have focused on developing meta-heuristic algorithms to tackle the graph partitioning problem. Local search is one of the earliest methods that has been applied efficiently to this type of problem. Recent studies have explored various types of local search methods and have improved them such that they can be used with the partitioning process. Moreover, local search methods are widely integrated with population-based approaches, to provide the best diversification and intensification for the problem space. This study emphasizes the local search approaches, as well as their combination with other graph partitioning approaches. At present, none of the surveys in the literature has focused on this class of state of the art approaches in much detail. In this study, the vital parts of these approaches including neighborhood structure, acceptance criterion, and the ways of combining them with other approaches, are highlighted. Additionally, we provide an experimental comparison that shows the variance in the performance of the reviewed methods. Hence, this study clarifies these methods to show their advantages and limitations for the targeted problem, and thus can aid in the direction of research flow towards the area of graph partitioning. © 2019 Fuji Technology Press. All rights reserved.
date: 2019
publisher: Fuji Technology Press
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060844898&doi=10.20965%2fjaciii.2019.p0005&partnerID=40&md5=63c16b02dd406eb6606c58668dc7bb5f
id_number: 10.20965/jaciii.2019.p0005
full_text_status: none
publication: Journal of Advanced Computational Intelligence and Intelligent Informatics
pagerange: 5-17
refereed: TRUE
issn: 13430130
citation:   Rais, H.M. and Abed, S.A. and Watada, J.  (2019) Computational comparison of major proposed methods for graph partitioning problem.  Journal of Advanced Computational Intelligence and Intelligent Informatics.  pp. 5-17.  ISSN 13430130