Results 1  10
of
31
A MultiScale Algorithm for the Linear Arrangement Problem
 Proc. 28th Inter. Workshop on GraphTheoretic Concepts in Computer Science (WG’02), LNCS 2573
, 2002
"... Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a lineartime algorithm for this problem, based on the multiscale paradigm. Experimental results are similar to those of the best known approaches, while the running ti ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a lineartime algorithm for this problem, based on the multiscale paradigm. Experimental results are similar to those of the best known approaches, while the running time is significantly better, enabling it to deal with much larger graphs. The paper contains a general multiscale construction, which may be used for a broader range of ordering problems.
JOSTLE: parallel multilevel graphpartitioning software – an overview
"... In this chapter we look at JOSTLE, the multilevel graphpartitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use a ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
In this chapter we look at JOSTLE, the multilevel graphpartitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use as a tool for parallel processing and, in particular, partitioning in parallel. Since its first release in 1995, JOSTLE has been used for many meshbased parallel scientific computing applications and so we also outline some enhancements such as multiphase meshpartitioning, heterogeneous mapping and partitioning to optimise subdomain shape.
Engineering Multilevel Graph Partitioning Algorithms
"... We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining these technique ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We present a multilevel graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on maxflow mincut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve the best known partitioning results for many inputs. For example, in Walshaw’s well known benchmark tables we achieve 317 improvements for the tables at 1%, 3 % and 5 % imbalance. Moreover, in 118 out of the 295 remaining cases we have been able to reproduce the best cut in this benchmark.
RELAXATIONBASED COARSENING AND MULTISCALE GRAPH ORGANIZATION
"... In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the “closeness” between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the “closeness” between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar notion of distance is then calculated and used at each coarser level. We demonstrate the use of this measure in multiscale methods for several important combinatorial optimization problems and discuss the multiscale graph organization.
A Multilevel Memetic Approach for Improving Graph Kpartitions
, 2011
"... Graph partitioning is one of the most studied NPcomplete problems. Given a graph G = (V, E), the task is to partition the vertex set V into k disjoint subsets of about the same size, such that the number of edges with endpoints in different subsets is minimized. In this work, we present a highly ef ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Graph partitioning is one of the most studied NPcomplete problems. Given a graph G = (V, E), the task is to partition the vertex set V into k disjoint subsets of about the same size, such that the number of edges with endpoints in different subsets is minimized. In this work, we present a highly effective multilevel memetic algorithm, which integrates a new multiparent crossover operator and a powerful perturbationbased tabu search algorithm. The proposed crossover operator tends to preserve the backbone with respect to a certain number of parent individuals, i.e. the grouping of vertices which is common to all parent individuals. Extensive experimental studies on numerous benchmark instances from the Graph Partitioning Archive show that the proposed approach, within a time limit ranging from several minutes to several hours, performs far better than any of the existing graph partitioning algorithm in terms of solution quality.
Costbased Partitioning for Distributed and Parallel Simulation of Decomposable Multiscale Constructive Models
, 2006
"... ..."
Comparison of coarsening schemes for multilevel graph partitioning
 in: Learning and Intelligent Optimization: Third International Conference, LION 3. Selected Papers
, 2009
"... partitioning ..."
An Effective Multilevel Tabu Search Approach for Balanced Graph Partitioning
, 2010
"... Graph partitioning is one of the fundamental NPcomplete problems which is widely applied in many domains, such as VLSI design, image segmentation, data mining etc. Given a graph G =(V,E), the balanced kpartitioning problem consists in partitioning the vertex set V into k disjoint subsets of about ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Graph partitioning is one of the fundamental NPcomplete problems which is widely applied in many domains, such as VLSI design, image segmentation, data mining etc. Given a graph G =(V,E), the balanced kpartitioning problem consists in partitioning the vertex set V into k disjoint subsets of about the same size, such that the number of cutting edges is minimized. In this paper, we present a multilevel algorithm for balanced partition, which integrates a powerful refinement procedure based on tabu search with periodic perturbations. Experimental evaluations on a wide collection of benchmark graphs show that the proposed approach not only competes very favorably with the two wellknown partitioning packages METIS and CHACO, but also improves more than two thirds of the best balanced partitions ever reported in the literature.
A Multilevel LinKernighanHelsgaun Algorithm for the Travelling Salesman Problem
 SE10 9LS
, 2001
"... The multilevel paradigm has recently been applied to the travelling salesman problem with considerable success. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs a local search algorithm to refine the solution on each of the coarsened problems in reverse ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The multilevel paradigm has recently been applied to the travelling salesman problem with considerable success. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs a local search algorithm to refine the solution on each of the coarsened problems in reverse order. In the original version the chained LinKernighan (CLK) scheme was used for the refinement. However, a new and highly effective LinKernighan variant (LKH) has recently been developed by Helsgaun. Here then we report on the modifications required to develop a multilevel LKH algorithm and the results achieved. Although the LKH algorithm, with its extremely high quality results, is more difficult to improve on than the CLK, nonetheless the multilevel framework was able to enhance the LKH performance. For example, in experiments on a well established test suite, the multilevel LKH scheme found 39 out of 59 optimal solutions as compared to the 33 found by LKH in a similar time period.
A multiagent algorithm for graph partitioning
"... The kcut problem is an NPcomplete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we prese ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The kcut problem is an NPcomplete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.