Subject: Hamilton cycles -- random graphs -- expected polynomial time algorithms - British Library Electronic Legal Deposit Catalogue-Journal Issues and Articles Search Results

Subject Hamilton cycles -- random graphs -- expected polynomial time algorithms

1. Finding a Hamilton cycle fast on average using rotations and extensions. Issue 1 (16th March 2020)

Authors:: Alon, Yahav; Krivelevich, Michael
Journal:: Random structures & algorithms
Issue:: Volume 57:Issue 1(2020)
Page Start:: 32
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗