Bibliography

1

A. V. Aho, J. E. Hopcroft, and J. D. Ullman.
Data Structures and Algorithms.
Addison-Wesley, 1983.

2

M. H. Austern.
Generic Programming and the STL.
Professional computing series. Addison-Wesley, 1999.

3

G. Baumgartner and V. F. Russo.
Signatures: A language extension for improving type abstraction and subtype polymorphism in C++.
Software-Practice and Experience, 25(8):863-889, August 1995.

4

R. Bellman.
On a routing problem.
Quarterly of Applied Mathematics, 16(1):87-90, 1958.

5

K. B. Bruce, L. Cardelli, G. Castagna, the Hopkins Objects Group, G. T. Leavens, and B. Pierce.
On binary methods.
Theory and Practice of Object Systems, 1:221-242, 1995.

6

T. F. Coleman, B. S. Garbow, and J. J. Mor'e.
Algorithm 649: Fortran subroutines for estimating sparse hessian matrices.
ACM Transactions on Mathematical Software, 11(4):378, December 1985.

7

T. F. Coleman and J. J. Mor'e.
Estimation of sparse jacobian matrices and graph coloring problems.
SIAM Journal on Numerical Analysis, 20:187-209,, 1984.

8

T. Cormen, C. Leiserson, and R. Rivest.
Introduction to Algorithms.
McGraw-Hill, 1990.

9

A. Curtis, M. Powell, and J. Reid.
On the estimation of sparse jacobian matrices.
Journal of the Institute of Mathematics and its Applications, 13:117-119, 1974.

10

E. Dijkstra.
A note on two problems in connexion with graphs.
Numerische Mathematik, 1:269-271, 1959.

11

L. R. Ford and D. R. Fulkerson.
Flows in networks.
Princeton University Press, 1962.

12

E. Gamma, R. Helm, R. Johnson, and J. Vlissides.
Design Patterns: Elements of Reusable Object-Oriented Software.
Professional Computing. Addison-Welsey, 1995.

13

A. George, J. R. Gilbert, and J. W. Liu, editors.
Graph Theory and Sparse Matrix Computation.
Springer-Verlag New York, Inc, 1993.

14

A. George and J. W.-H. Liu.
Computer Solution of Large Sparse Positive Definite Systems.
Computational Mathematics. Prentice-Hall, 1981.

15

R. Graham and P. Hell.
On the history of the minimum spanning tree problem.
Annals of the History of Computing, 7(1):43-57, 1985.

16

P. E. Hart, N. J. Nilsson, and B. Raphael.
A formal basis for the heuristic determination of minimum cost paths.
IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.

18

J. B. Kruskal.
On the shortest spanning subtree of a graph and the traveling salesman problem.
In Proceedings of the American Mathematical Sofiety, volume 7, pages 48-50, 1956.

19

D. Kühl.
Design patterns for the implementation of graph algorithms.
Master's thesis, Technische Universität Berlin, July 1996.

20

E. L. Lawler.
Combinatorial Opimization: Networks and Matroids.
Holt, Rinehart, and Winston, 1976.

21

J. W. H. Liu.
Modification of the minimum-degree algorithm by multiple elimination.
ACM Transaction on Mathematical Software, 11(2):141-153, 1985.

22

K. Mehlhorn and S. Näher.
The LEDA Platform of Combinatorial and Geometric Computing.
Cambridge University Press, 1999.

23

B. Meyer.
Object-oriented Software Construction.
Prentice Hall International Series in Computer Science. Prentice Hall, 1988.

24

N. C. Myers.
Traits: a new and useful template technique.
C++ Report, June 1995.

25

R. Prim.
Shortest connection networks and some generalizations.
Bell System Technical Journal, 36:1389-1401, 1957.

26

Y. Saad.
Iterative Methods for Sparse Minear System.
PWS Publishing Company, 1996.

27

R. E. Tarjan.
Data Structures and Network Algorithms.
Society for Industrial and Applied Mathematics, 1983.

28

Seymour Parter.
The use of linear graphs in Gauss elimination.
SIAM Review, 1961 3:119-130.

29

D. Matula, G. Marble, and J. Isaacson
Graph coloring algorithms in Graph Theory and Computing.
Academic Press, pp.104-122, 1972.

30

M.R. Garey and D.S. Johnson
Computers and Intractibility: A Guide to the Theory of NP-Completeness
W.H. Freeman, New York, 1979.

31

D. Welsch and M. B. Powel
An upper bound for the chromatic number of a graph and its application to timetabling problems Computer Journal, 10:85-86, 1967.

32

D. Br'elaz
New methods to color the vertices of a graph
Communications of the ACM, vol. 22, 1979, pp. 251-256.

33

G. Heber, R. Biswas, G.R. Gao
Self-Avoiding Walks over Adaptive Unstructured Grids
Parallel and Distributed Processing, LNCS 1586, Springer-Verlag, 1999, pp. 968-977

34

Esmond G. Ng amd Padma Raghavan
Performance of greedy ordering heuristics for sparse {C}holesky factorization
SIAM Journal on Matrix Analysis and Applications (To appear)

35

Alan George and Joseph W. H. Liu
The Evolution of the Minimum Degree Ordering Algorithm
SIAM Review, March 1989, vol. 31, num. 1, pp. 1-19.