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

References
LT79
LT80
8:99-118, 1995.
R. Lipton and R. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied
Mathematics, 36:346-358, 1979.
R. Lipton and R. Tarjan. Applications of a planar separator theorem. SIAM J. Computing, 9:615-
626, 1980.
Luc91
E. Lucas. Récréations Mathématiques. Gauthier-Villares, Paris, 1891.
Luk80
E. M. Luks. Isomorphism of bounded valence can be tested in polynomial time. In Proc. of the
21st Annual Symposium on Foundations of Computing, pages 42-49. IEEE, 1980.
LV93
LW77
LW88
LY93
M. Li and P. Vitáni. An introduction to Kolmogorov complexity and its applications. Springer-
Verlag, New York, 1993.
D. T. Lee and C. K. Wong. Worst-case analysis for region and partial region searches in
multidimensional binary search trees and balanced quad trees. Acta Informatica, 9:23-29, 1977.
T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined
graphs. SIAM J. Computing, 17:1063-1080, 1988.
C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. In Proc.
25th ACM Symp. Theory of Computing (STOC), pages 286-293, 1993.
Man89
U. Manber. Introduction to Algorithms. Addison-Wesley, Reading MA, 1989.
Mar83
S. Martello. An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM
Trans. Math. Softw., 9(1):131-138, March 1983.
Mat87
D. W. Matula. Determining edge connectivity in O(nm). In 28th Ann. Symp. Foundations of
file:///E|/BOOK/BOOK5/NODE232.HTM (32 of 50) [19/1/2003 1:28:02]