Bibliography

1

S. T. Barnard and H. D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, 1994, 6, 101-117.

2

P. Diniz, S. Plimpton, B. Hendrickson and R. Leland, Parallel algorithms for dynamically partitioning unstructured grids, in: D.H. Bailey, P. E. Bjorstad, Jr Gilbert, M. V. Mascagni, R. S. Schreiber, H. D. Simon, V. J. Torczon, J. T. Watson, eds., SIAM Proceedings Series 195, SIAM, Philadelphia, 1995, 615-620.

3

C. Farhat, A simple and efficient automatic FEM domain decomposer, Computer and Structures, 1988, 28, 579-602.

4

R. Gould, Graph Theory, The Benjamin/Cummings Publishing Company, 1988.

5

B. Hendrickson and R. Leland, The Chaco User's Guide, Version 1.0, Technical Report SAND 93-2339, Sandia National Laboratories, Allbuquerque, NM., 1993.

6

A. J. G. Hey, R. Hockney, V. Getov, I. Wolton, J. Melin and J. Allwright, The Genesis distributed memory benchmarks. Part2: COMMS1, TRANS1, FFT1 and QCD2 benchmarks on the SUPERNUM and iPSC/860 computers, Concurrency: Practice and Experience, 1995, 7, 543-570.

7

I. Holyer, The NP-completeness of edge-colouring, SIAM Journal of Computing, 1981, 10, 718-720.

8

Y. F. Hu and R. J. Blake, Numerical experiences with partitioning of unstructured meshes, Parallel Computing, 1994, 20, 815-829.

9

G. Karypis and V. Kumar, Parallel multilevel graph partitioning, Technical Report, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, 1995.

10

G. Karypis and V. Kumar, Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs, Technical Report, Department of Computer Science, University of Minnesota, MN 55455, 1996.

11

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Systems Tech. J., 1970, 49, 291-308.

12

J. Peiro, J. Peraire and K. Morgan, FELISA System Version 1.0, User Manual.

13

H. D. Simon, Partitioning of unstructured problems for parallel processing, Computer Systems in Engineering, 1991, 2, 135-148.

14

V. Venkatakrishnan, H. D. Simon and T. J. Barth, A MIMD implementation of a parallel Euler solver for unstructured Grids, Journal of Supercomputing, 1992, 6, 117-137.

15

V. G. Vizing, On an estimate of the chromatic class of a $p$-graph (Russian), Diskret. Analiz, 1964, 3, 25-30.

16

C. Walshaw, M. Cross, and M. Everett, A parallelisable algorithm for optimising unstructured mesh partitions, Technical Report 95/IM/03, University of Greenwich, London SE18 6PF, UK, 1995.

17

C. Walshaw, M. Cross and M. Everett, Dynamic load balancing for parallel adaptive unstructured meshes, in: M. Head et al. eds, Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1997.

18

R. D. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice and Experience, 1991, 3, 457-481.

Hosted by www.Geocities.ws