Skip to main content
Conference Proceedings

On the use of some almost sure graph properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 100 LNCS 113-126
DOI: 10.1007/3-540-10291-4_9
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper deals with some almost sure graph properties. A very efficient algorithm is given which yields a sample graph from the uniform distribution on the set of all connected graphs of given size n. An almost surely canonical graph labelling and an algorithm which tries to find a Hamiltonian cycle in a given graph are discussed.

Cite

CITATION STYLE

APA

Tinhofer, G. (1981). On the use of some almost sure graph properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 113–126). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free