{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:55Z","timestamp":1759639075541},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00241-3","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"235-260","source":"Crossref","is-referenced-by-count":25,"title":["Analysis of greedy algorithms on graphs with bounded degrees"],"prefix":"10.1016","volume":"273","author":[{"given":"Nicholas C.","family":"Wormald","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00241-3_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-SAT, in: 32nd Annual ACM Symposium on Theory of Computing (STOC 32), Portland, OR, USA, 2000, pp. 28\u201337.","DOI":"10.1145\/335305.335309"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB3","unstructured":"W. Duckworth, Greedy algorithms and cubic graphs, Doctoral Thesis, University of Melbourne, 2001."},{"key":"10.1016\/S0012-365X(03)00241-3_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/rsa.10047","article-title":"Minimum independent dominating sets of random cubic graphs","volume":"21","author":"Duckworth","year":"2002","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0377-0427(01)00457-5","article-title":"Maximum induced matchings of random cubic graphs","volume":"142","author":"Duckworth","year":"2002","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00241-3_BIB6","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1002\/rsa.3240050504","article-title":"On the independence number of random cubic graphs","volume":"5","author":"Frieze","year":"1994","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB7","series-title":"Lectures on Ordinary Differential Equations","author":"Hurewicz","year":"1958"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB8","series-title":"Ordinary Differential Equations","author":"Ince","year":"1927"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB9","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1214\/aoap\/1177004612","article-title":"Differential equations for random processes and random graphs","volume":"5","author":"Wormald","year":"1995","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/S0012-365X(03)00241-3_BIB10","series-title":"Surveys in Combinatorics, 1999 (Canterbury)","first-page":"239","article-title":"Models of random regular graphs","author":"Wormald","year":"1999"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB11","series-title":"Lectures on Approximation and Randomized Algorithms","first-page":"73","article-title":"The differential equation method for random graph processes and greedy algorithms","author":"Wormald","year":"1999"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB12","doi-asserted-by":"crossref","unstructured":"M. Zito, Induced matchings in regular graphs and trees, in: Proceedings of the 25th International Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1665, Springer, Berlin, 1999, pp. 89\u2013100.","DOI":"10.1007\/3-540-46784-X_10"},{"key":"10.1016\/S0012-365X(03)00241-3_BIB13","doi-asserted-by":"crossref","unstructured":"M. Zito, Greedy algorithms for minimisation problems in random regular graphs, in: F. Meyer auf der Heide (Ed.), Algorithms\u2014ESA 2001, Lecture Notes in Computer Science, Vol. 2161, Springer, Berlin, 2001, pp. 524\u2013536.","DOI":"10.1007\/3-540-44676-1_44"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T14:57:56Z","timestamp":1585148276000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002413"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00241-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}