Filter Results:
- Full text PDF available (30)
Publication Year
1993
2018
- This year (2)
- Last 5 years (5)
- Last 10 years (13)
Publication Type
Co-author
Journals and Conferences
Learn More
- Chris Walshaw
- J. Graph Algorithms Appl.
- 2000
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of… (More)
- Chris Walshaw, Mark Cross
- SIAM J. Scientific Computing
- 2000
Multilevel algorithms are a successful class of optimisation techniqueswhich address themeshpartitioning problem. They usually combine a graph contraction algorithm together with a local optimisation… (More)
- Chris Walshaw, Mark Cross, Martin G. Everett
- J. Parallel Distrib. Comput.
- 1997
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both… (More)
- Chris Walshaw, Mark Cross
- Parallel Computing
- 2000
Three parallel optimisation algorithms, for use in the context of multilevel graph partitioning of unstructured meshes, are described. The ®rst, interface optimisation, reduces the computation to a… (More)
- Chris Walshaw
- 2004
- Alan J. Soper, Chris Walshaw, Mark Cross
- J. Global Optimization
- 2004
Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined… (More)
- Chris Walshaw
- Operations Research
- 2002
We motivate, derive and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs either the… (More)
- Chris Walshaw, Mark Cross
- Future Generation Comp. Syst.
- 2001
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine… (More)
- Chris Walshaw, Martin Berzins
- Concurrency - Practice and Experience
- 1995
Modern PDE solvers written for time-dependent problems increasingly employ adaptive unstructured meshes (see Flaherty et al. [4]) in order to both increase e ciency and control the numerical error.… (More)
A new method is described for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both… (More)