The.Algorithm.Design.Manual.Springer-Verlag.1998

References
N. Gibbs, W. Poole, and P. Stockmeyer. A comparison of several bandwidth and profile reduction
algorithms. ACM Trans. Math. Software, 2:322-330, 1976.
Gra53
F. Gray. Pulse code communication. US Patent 2632058, March 17, 1953.
Gra72
R. Graham. An efficient algorithm for determining the convex hull of a finite planar point set. Info.
Proc. Letters, 1:132-133, 1972.
GS62
GS78
GT88
GT89
D. Gale and L. Shapely. College admissions and the stability of marriages. American Math.
Monthly, 69:9-14, 1962.
L. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE
Symp. Foundations of Computer Science, pages 8-21, 1978.
A. Goldberg and R. Tarjan. A new approach to the maximum flow problem. J. ACM, pages 921-
940, 1988.
H. Gabow and R. Tarjan. Faster scaling algorithms for network problems. SIAM J. Computing,
18:1013-1036, 1989.
Gup66
R. P. Gupta. The chromatic index and the degree of a graph. Notices of the Amer. Math. Soc.,
13:66T-429, 1966.
Gus97
D. Gusfield. String Algorithms. Cambridge University Press, 1997.
GW95
M. Goemans and D. Williamson. .878-approximation algorithms for MAX CUT and MAX 2SAT.
J. ACM, 42:1115-1145, 1995.
HD80
HG95
P. Hall and G. Dowling. Approximate string matching. ACM Computing Surveys, 12:381-402,
1980.
file:///E|/BOOK/BOOK5/NODE232.HTM (22 of 50) [19/1/2003 1:28:02]