Research supported by the National Science Foundation under Grant MCS 77-09906
This is a preview of subscription content, log in via an institution to check access.
References
Angluin, D. and L.G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. Proc. Ninth ACM Symposium on Theory of Computing (1977)
Apers, P., The Expected Number of Phases of the Dinic-Karzanov Network Flow Algorithm. Informatica Rapport IR 27. Vrije Universiteit, Amsterdam (1978)
Chvátal, V., Determining the Stability Number of a Graph. SIAM J. Comp 6 (1977) 643–662.
Erdös, P. and A. Rényi., On Random Graphs I, Publicationes Mathematicae 6 (1959) 290–297.
Erdös, P. and A. Rényi, On the Evolution of Random Graphs, Publ. Math. Inst. Hung. Acad. Sci. 5A (1960), 17–61.
Erdös, P. and A. Rényi, On Random Matrices, Publ. Math. Inst. Hung. Acad. Sci., 8A (1963), 455–461.
Erdös, P. and A. Rényi, On the Existence of a Factor of Degree One of a Connected Random Graph, Acta Math. Acad. Sci. Hung. 17 (1966), 359–368.
Grimmett, G. R. and C. J. H. McDiarmid, On Coloring Random Graphs, Math. Proc. Camb. Phil. Soc. 77 (1975), 313–324.
Hamacher, H., Numerical Investigations on the Maximal Flow Algorithm of Karzanov. Report 78-7, Mathematisches Institut, Universität zu Köln, (1978)
Karp, R. M., The Probabilistic Analysis of Some Combinatorial Search Algorithms. Algorithms and Complexity: New Directions and Recent Results (Ed. J. Traub), Academic Press (1976).
Karp, R. M., A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. To appear in SIAM J. Comp. (1979).
Karp, R. M. Probabilistic Analysis of a Canonical Numbering Algorithm for Graphs. Proc. AMS Symposia in Applied Mathematics 34 (1979).
Karp, R. M., An Algorithm to Solve the m x n Assignment Problem in Expected Time O (mn log n), Memorandum No. UCB/ERL M78/67, Electronics Research Laboratory, University of California, Berkeley (1978)
Lueker, G. S., Maximization Problems on Graphs with Edge Weights Chosen From a Normal Distribution. Proc. Tenth ACM Symposium on Theory of Computing (1978)
McDiarmid, C., Determining the Chromatic Number of a Graph, SIAM J. Comp. 8 (1979) 1–14.
Posa, L., Hamiltonian Circuits in Random Graphs, Discrete Math. 14 (1976) 359–364.
Schnorr, C. P., An Algorithm for Transitive Closure with Linear Expected Time. SIAM J. Comp. 7 (1978) 127–133.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karp, R.M. (1979). Recent advances in the probabilistic analysis of graph-theoretic algorithms. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive