|
5164
|
1 @string{SIREV = "{SIAM} Review"} |
|
|
2 @string{SIMAX = "{SIAM} J. Matrix Anal. Applic."} |
|
|
3 @string{SIAMJSC = "{SIAM} J. Sci. Comput."} |
|
|
4 @string{TOMS = "{ACM} Trans. Math. Softw."} |
|
|
5 |
|
|
6 @article{schu:01, |
|
|
7 author = {J. Schulze}, |
|
|
8 title = {Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods}, |
|
|
9 journal = {BIT}, |
|
|
10 volume = {41}, |
|
|
11 number = {4}, |
|
|
12 pages = "800--841", |
|
|
13 year = {2001} |
|
|
14 } |
|
|
15 |
|
|
16 @article{GeorgeLiu89, |
|
|
17 author={George, A. and Liu, J. W. H.}, |
|
|
18 year={1989}, |
|
|
19 title={The Evolution of the Minimum Degree Ordering Algorithm}, |
|
|
20 journal=SIREV, |
|
|
21 volume={31}, |
|
|
22 number={1}, |
|
|
23 pages={1--19}} |
|
|
24 |
|
|
25 @article{AmestoyDavisDuff96, |
|
|
26 author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.}, |
|
|
27 title={An approximate minimum degree ordering algorithm}, |
|
|
28 journal=SIMAX, |
|
|
29 year={1996} |
|
|
30 ,volume={17} |
|
|
31 ,number={4} |
|
|
32 ,pages={886-905} |
|
|
33 } |
|
|
34 |
|
|
35 @misc{hsl:2002, |
|
|
36 author = {HSL}, |
|
|
37 title = "{HSL} 2002: {A} collection of {F}ortran codes for large |
|
|
38 scale scientific computation", |
|
|
39 note = {{\tt www.cse.clrc.ac.uk/nag/hsl}}, |
|
|
40 year = 2002} |
|
|
41 |
|
|
42 |
|
|
43 @article{RothbergEisenstat98, |
|
|
44 author={Rothberg, E. and Eisenstat, S. C.}, |
|
|
45 title={Node selection strategies for bottom-up sparse matrix orderings}, |
|
|
46 journal=SIMAX, |
|
|
47 year={1998} |
|
|
48 ,volume={19} |
|
|
49 ,number={3} |
|
|
50 ,pages={682-695} |
|
|
51 } |
|
|
52 |
|
|
53 @article{KarypisKumar98e, |
|
|
54 author={Karypis, G. and Kumar, V.}, |
|
|
55 title={A fast and high quality multilevel scheme for partitioning irregular graphs}, |
|
|
56 journal=SIAMJSC, |
|
|
57 year={1998} |
|
|
58 ,volume={20} |
|
|
59 ,pages={359-392} |
|
|
60 } |
|
|
61 |
|
|
62 @article{Chaco, |
|
|
63 author={B. Hendrickson and E. Rothberg}, |
|
|
64 title={Improving the runtime and quality of nested dissection ordering}, |
|
|
65 journal=SIAMJSC, |
|
|
66 year={1999} |
|
|
67 ,volume={20} |
|
|
68 ,pages={468--489} |
|
|
69 } |
|
|
70 |
|
|
71 @article{PellegriniRomanAmestoy00, |
|
|
72 author={Pellegrini, F. and Roman, J. and Amestoy, P.}, |
|
|
73 title={Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering}, |
|
|
74 journal={Concurrency: Practice and Experience}, |
|
|
75 year={2000} |
|
|
76 ,volume={12} |
|
|
77 ,pages={68-84} |
|
|
78 } |
|
|
79 |
|
|
80 @article{DavisGilbertLarimoreNg00pending, |
|
|
81 author={Davis, T. A. and Gilbert, J. R. and Larimore, S. I. and Ng, E. G.}, |
|
|
82 title={A column approximate minimum degree ordering algorithm}, |
|
|
83 journal=TOMS, |
|
|
84 year={(to appear)} |
|
|
85 } |
|
|
86 |
