1. A. Agrawal, “Network Design and Network Cut Dualities: Approximation Algorithms and Applications,” Ph.D. thesis, Technical Report CS-91–60, Brown University (1991).
2. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson and T. Kloks, “Approximating treewidth, pathwidth, and minimum elimination tree height,” Technical Report CSL-90–01, Xerox Corporation, Palo Alto Research Center (1990).
3. E. Cuthill, and J. McKee, “Reducing the bandwidth of sparse symmetric matrices,” Proceedings of the 24th National Conference of the ACM (1969), pp. 157–172.
4. I. S. Duff, A. M. Erisman, and J. K. Reid, “On George’s nested dissection method,” SIAM Journal on Numerical Analysis, vol. 13 (1976), pp. 686–695.
5. I. Duff, N. Gould, M. Lescrenier, and J. K. Reid, “The multifrontal method in a parallel environment,” in Advances in Numerical Computation, M. Cox and S. Hammarling, eds., Oxford University Press (1990).