test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9464

Title: Generating and Counting Hamilton Cycles in Random Regular Graphs
Authors: Frieze, A.
Jerrum, M.
Molloy, M.
Robinson, R. W.
Keywords: Hamilton cycle
algorithms
Issue Date: Jul-1996
Publisher: Elsevier
Citation: Frieze, A., Jerrum, M., Molloy M., Robinson, R. W., and Wormald, N. C. Generating and Counting Hamilton Cycles in Random Regular Graphs; Journal of Algorithms Vol. 21, 1996, 176-198.
Abstract: Let G be chosen uniformly at random from the set G script sign(r, n) of mr-regular graphs with vertex set [n]. We describe polynomial time algorithms that whp (i) find a Hamilton cycle in G, and (ii) approximately count the number of Hamilton cycles in G
Description: published source had been acknowledged original journal website: http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html
URI: http://hdl.handle.net/1807/9464
ISSN: 0196-6774
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
generating and counting hamilton cycles in random regular graphs.pdf288.24 kBAdobe PDF
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft