{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:54Z","timestamp":1759638894113},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278733"},{"type":"electronic","value":"9783540318606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527954_7","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T11:51:11Z","timestamp":1267444271000},"page":"63-74","source":"Crossref","is-referenced-by-count":6,"title":["A Distributed Algorithm to Find Hamiltonian Cycles in $\\mathcal{G}(n, p)$ Random Graphs"],"prefix":"10.1007","author":[{"given":"Eythan","family":"Levy","sequence":"first","affiliation":[]},{"given":"Guy","family":"Louchard","sequence":"additional","affiliation":[]},{"given":"Jordi","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for hamiltonian circuits and matchings. Journal of Computer and System Sciences\u00a018, 155\u2013193 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems. In: Proc. 19th Symp. on Theory of Computing, pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"key":"7_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random graphs, 2nd edn. Academic Press, London (2001)","edition":"2"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02579321","volume":"7","author":"B. Bollob\u00e1s","year":"1987","unstructured":"Bollob\u00e1s, B., Fenner, T.I., Frieze, A.M.: An algorithm for finding Hamilton paths and cycles in random graphs. Combinatorica\u00a07(4), 327\u2013341 (1987)","journal-title":"Combinatorica"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0129626400000329","volume":"10","author":"J. D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: Faulty random geometric networks. Parallel Processing Letters\u00a010(4), 343\u2013357 (2001)","journal-title":"Parallel Processing Letters"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/TMC.2003.1233525","volume":"2","author":"J. D\u00edaz","year":"2003","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A random graph model for optical smart dust networks. IEEE Transactions on Mobile Computing\u00a02(3), 186\u2013196 (2003)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Molle, M.: Optimal distributed algorithm for minimum spanning trees revisited. In: Symposium on Principles of Distributed Computing, pp. 231\u2013237 (1995)","DOI":"10.1145\/224964.225474"},{"key":"7_CR8","unstructured":"Flajolet, P., Sedgewick, R.: The average case analysis of algorithms: Saddle point asymptotics. Technical Report RR-2376, INRIA (1994)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(87)90229-8","volume":"25","author":"A. Frieze","year":"1987","unstructured":"Frieze, A.: Parallel algorithms for finding hamilton cycles in random graphs. Information Processing Letters\u00a025, 111\u2013117 (1987)","journal-title":"Information Processing Letters"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/0216034","volume":"16","author":"Y. Gurevich","year":"1987","unstructured":"Gurevich, Y., Shelah, S.: Expected computation time for hamiltonian path problem. SIAM Journal on Computing\u00a016(3), 486\u2013502 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"3-4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1002\/rsa.10008","volume":"19","author":"P. Hitczenko","year":"2001","unstructured":"Hitczenko, P., Louchard, G.: Distinctness of compositions of an integer: A probabilistic analysis. Random Structures & Algorithms\u00a019(3-4), 407\u2013437 (2001)","journal-title":"Random Structures & Algorithms"},{"key":"7_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley, New York (2000)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The Web as a graph: Measurements, models and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, p. 1. Springer, Heidelberg (1999)"},{"key":"7_CR14","unstructured":"Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Extracting large-scale knowledge bases from the web. VLDB Journal, 639\u2013650 (1999)"},{"key":"7_CR15","unstructured":"Levy, E.: Distributed algorithms for finding hamilton cycles in faulty random geometric graphs. M\u00e9moire de licence (master\u2019s thesis), Universit\u00e9 Libre de Bruxelles (2002), \n                    \n                      http:\/\/www.ulb.ac.be\/di\/scsi\/elevy\/"},{"key":"7_CR16","unstructured":"Levy, E.: Analyse et conception d\u2019un algorithme de cycle hamiltonien pour graphes al\u00e9atoires du type g(n,p). M\u00e9moire de DEA, Ecole Polytechnique, Paris (2003), \n                    \n                      http:\/\/www.ulb.ac.be\/di\/scsi\/elevy\/"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"MacKenzie, P.D., Stout, Q.F.: Optimal parallel construction of hamiltonian cycles and spanning trees in random graphs. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 224\u2013229 (1993)","DOI":"10.1145\/165231.165260"},{"key":"7_CR18","unstructured":"Nikoletseas, S., Spirakis, P.: Efficient communication establishment in adverse communication environments. In: Rolim, J. (ed.) ICALP Workshops. Proceedings in Informatics, vol.\u00a08, pp. 215\u2013226. Carleton Scientific (2000)"},{"key":"7_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0012-365X(89)90100-3","volume":"75","author":"A.G. Thomason","year":"1989","unstructured":"Thomason, A.G.: A simple linear expected time algorithm for finding a hamilton path. Discrete Mathematics\u00a075, 373\u2013379 (1989)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527954_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:08:25Z","timestamp":1605625705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527954_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278733","9783540318606"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11527954_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}