{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T15:40:02Z","timestamp":1688485202323},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T00:00:00Z","timestamp":1379030400000},"content-version":"vor","delay-in-days":9571,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1987,7]]},"DOI":"10.1016\/s0195-6698(87)80036-7","type":"journal-article","created":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T04:31:20Z","timestamp":1379046680000},"page":"303-311","source":"Crossref","is-referenced-by-count":0,"title":["Maximal Paths in Random Dynamic Graphs"],"prefix":"10.1016","volume":"8","author":[{"given":"Richard","family":"Loulou","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(87)80036-7_bib1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollobas","year":"1980","journal-title":"Europ. J. Combinatories"},{"key":"10.1016\/S0195-6698(87)80036-7_bib2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","article-title":"Almost all regular graphs are Hamiltonian","volume":"4","author":"Bollobas","year":"1983","journal-title":"Europ J. Combinatories"},{"key":"10.1016\/S0195-6698(87)80036-7_bib3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1017\/S0305004100032680","article-title":"Percolation processes I. Crystals and mazes","volume":"53","author":"Broadbent","year":"1957","journal-title":"Proc. Cam. Phil. Soc."},{"key":"10.1016\/S0195-6698(87)80036-7_bib4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"10.1016\/S0195-6698(87)80036-7_bib5","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0195-6698(87)80036-7_bib6","volume":"1","author":"Feller","year":"1957"},{"key":"10.1016\/S0195-6698(87)80036-7_bib7","series-title":"Hamiltonian cycles in random regular graphs, working paper of the Dept. of Computer Science and Statistics","author":"Fenner","year":"1982"},{"key":"10.1016\/S0195-6698(87)80036-7_bib8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/moor.5.1.27","article-title":"Probabilistic analysis of the Euclidean K-median problem","volume":"5","author":"Fischer","year":"1980","journal-title":"Math Oper. Res."},{"key":"10.1016\/S0195-6698(87)80036-7_bib9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(80)90026-8","article-title":"Probabilistic analysis of some Euclidean clustering problems","volume":"2","author":"Frieze","year":"1980","journal-title":"Discr appl. Math."},{"key":"10.1016\/S0195-6698(87)80036-7_bib10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0211003","article-title":"A fast algorithm for the Euclidean traveling salesman problem, optimal with probability one","volume":"11","author":"Halton","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0195-6698(87)80036-7_bib11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the traveling salesman problem","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0195-6698(87)80036-7_bib12","series-title":"Probability Theory","author":"Loeve","year":"1960"},{"key":"10.1016\/S0195-6698(87)80036-7_bib13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0210024","article-title":"Optimization Problems on Graphs with Independent Random Edge Weights","volume":"10","author":"Lueker","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0195-6698(87)80036-7_bib14","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1137\/0210040","article-title":"Worst-case and probabilistic analysis of a geometric location problem","volume":"10","author":"Papadimitriou","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0195-6698(87)80036-7_bib15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"Posa","year":"1976","journal-title":"Discrete Math"},{"key":"10.1016\/S0195-6698(87)80036-7_bib16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1080\/00018737100101261","article-title":"An introduction to percolation theory","volume":"20","author":"Shante","year":"1971","journal-title":"Adv. Phys."},{"key":"10.1016\/S0195-6698(87)80036-7_bib17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1214\/aoms\/1177731909","article-title":"On a test whether two samples are from the same population","volume":"2","author":"Wald","year":"1940","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0195-6698(87)80036-7_bib18","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","article-title":"On the expected value of a random assignment problem","volume":"8","author":"Walkup","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0195-6698(87)80036-7_bib19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in random regular bipartite digraphs","volume":"31","author":"Walkup","year":"1980","journal-title":"Discrete Math"},{"key":"10.1016\/S0195-6698(87)80036-7_bib20","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1137\/0209041","article-title":"Random graphs and graph optimization problems","volume":"9","author":"Weide","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669887800367?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669887800367?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T15:06:37Z","timestamp":1688483197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669887800367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["S0195669887800367"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(87)80036-7","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}