Paper Title:
Local Refinement for Graph Partitioning Based on Level Structure
  Abstract

Graph partitioning is a fundamental problem in several scientific and engineering applications. In this paper, we propose a heuristic local refinement algorithm for graph partitioning, which seeks to improve the quality of separators by reducing the width of the level structure. The experiments reported in this paper show that the use of our local refinement algorithm results in a considerable improvement in the quality of partitions over conventional graph partitioning scheme based on level structure.

  Info
Periodical
Chapter
Chapter 3: Computational Methods for Engineering
Edited by
Elwin Mao and Linli Xu
Pages
257-261
DOI
10.4028/www.scientific.net/AEF.1.257
Citation
L. Yao, Z. H. Wang, W. Cao, Z. Z. Li, "Local Refinement for Graph Partitioning Based on Level Structure", Advanced Engineering Forum, Vol. 1, pp. 257-261, 2011
Online since
September 2011
Export
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Chun Yu Ren
Abstract:The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search....
160
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502
Authors: Sun Xin Wang, Yan Li, Yan Rong Zhang
Chapter 15: Economics, Marketing and Engineering Management
Abstract:In this paper a hybrid algorithm named IPSO-VND is proposed and applied to solving the vehicle routing problem with simultaneous pickup and...
2326