{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:10:12Z","timestamp":1740258612041,"version":"3.37.3"},"reference-count":10,"publisher":"Wiley","issue":"2-3","license":[{"start":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T00:00:00Z","timestamp":1183593600000},"content-version":"vor","delay-in-days":4509,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"USA-Israeli BSF"},{"DOI":"10.13039\/100000879","name":"Sloan Foundation","doi-asserted-by":"crossref","award":["93-6-6"],"award-info":[{"award-number":["93-6-6"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"crossref"}]},{"name":"OTKA Research Fund of the Hungarian Academy of Sciences","award":["2569"],"award-info":[{"award-number":["2569"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1995,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that in the random graph<jats:italic>G<jats:sub>n<\/jats:sub><jats:sub>p<\/jats:sub><\/jats:italic>with (fixed) edge probability<jats:italic>p<\/jats:italic>&gt; 0, the number of edges that have to be examined in order to identify an<jats:italic>acyclic<\/jats:italic>orientation is \u03b8(n log n) almost surely. For unrestricted<jats:italic>p<\/jats:italic>, an upper bound of<jats:italic>O(n<\/jats:italic>log<jats:sup>3<\/jats:sup>n) is established. Graphs<jats:italic>G<\/jats:italic>=<jats:italic>(V, E)<\/jats:italic>in which all edges have to be examined are considered, as well.<\/jats:p>","DOI":"10.1002\/rsa.3240060213","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T06:37:43Z","timestamp":1278916663000},"page":"261-268","source":"Crossref","is-referenced-by-count":7,"title":["The acyclic orientation game on random graphs"],"prefix":"10.1002","volume":"6","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,7,5]]},"reference":[{"journal-title":"Searching for acyclic orientations of graphs","author":"Aigner M.","key":"e_1_2_1_1_2"},{"key":"e_1_2_1_2_2","first-page":"117","article-title":"Almost sorting in one round","volume":"5","author":"Ajtai M.","year":"1989","journal-title":"Adv. Comput. Res."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0401028"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"N.AlonandY.Azar Parallel comparison algorithms for approximation problems Proc. 29th IEEE FOCS Yorktown Heights NY 1988 pp.194\u2013203.","DOI":"10.1109\/SFCS.1988.21937"},{"key":"e_1_2_1_4_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206355"},{"volume-title":"The Probabilistic Method","year":"1991","author":"Alon N.","key":"e_1_2_1_5_2"},{"volume-title":"Random Graphs","year":"1985","author":"Bollob\u00e1s B.","key":"e_1_2_1_6_2"},{"key":"e_1_2_1_7_2","unstructured":"N.KahaleandL.Schulman Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph to appear."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"U.ManberandM.Tompa The effect of the number of Hamiltonian paths on the complexity of a vertex coloring problem Proc. 25th IEEE FOCS Singer Island FL.1984 pp.220\u2013227.","DOI":"10.1109\/SFCS.1981.47"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216066"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240060213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240060213","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240060213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T20:51:04Z","timestamp":1740257464000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240060213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1002\/rsa.3240060213"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240060213","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"type":"print","value":"1042-9832"},{"type":"electronic","value":"1098-2418"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}