{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:53Z","timestamp":1759063613947},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81015-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"223-235","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Large 2-Independent Sets of Regular Graphs"],"prefix":"10.1016","volume":"78","author":[{"given":"W.","family":"Duckworth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB1","unstructured":"Assiyatun H. Large Subgraphs of Regular Graphs. Doctoral Thesis, Department of Mathematics & Statistics, The University of Melbourne, Australia, 2001."},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB2","series-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"Attiya","year":"1998"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Beis M., Duckworth W. and Zito M. Packing Edges in Random Regular Graphs. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2002), Warszawa-Otwock, Poland, August 2002. Lecture Notes in Computer Science, 2420:118\u2013130. Springer Verlag.","DOI":"10.1007\/3-540-45687-2_9"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB4","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB5","series-title":"Graph Theory","author":"Diestel","year":"2000"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB6","unstructured":"Duckworth W. Greedy Algorithms and Cubic Graphs. Doctoral Thesis, Department of Mathematics & Statistics, The University of Melbourne, Australia, 2001."},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB7","unstructured":"Duckworth W. Maximum 2-Independent Sets of Random Cubic Graphs. The Australasian Journal of Combinatorics. To appear."},{"issue":"2","key":"10.1016\/S1571-0661(04)81015-6_NEWBIB8","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 Structures and Algorithms"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S1571-0661(04)81015-6_NEWBIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1008791627588","article-title":"An Efficient Algorithm for Finding a Maximum Weight \u03ba-Independent Set on Trapezoid Graphs","volume":"18","author":"Hota","year":"2001","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB11","first-page":"47","article-title":"On Computing Maximum \u03ba-Independent Sets","volume":"95","author":"Kong","year":"1993","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB12","first-page":"65","article-title":"Computing \u03ba-Independent Sets for Regular Bipartite Graphs","volume":"143","author":"Kong","year":"2000","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB13","first-page":"179","volume":"23A","author":"McKay","year":"1987","journal-title":"Independent Sets in Regular Graphs of High Girth. Ars Combinatoria"},{"issue":"4","key":"10.1016\/S1571-0661(04)81015-6_NEWBIB14","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":"The Annals of Applied Probability"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB15","series-title":"In Surveys in combinatorics, 1999 (Canterbury)","first-page":"239","article-title":"Models of Random Regular Graphs","author":"Wormald","year":"1999"},{"key":"10.1016\/S1571-0661(04)81015-6_NEWBIB16","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\/S1571-0661(04)81015-6_NEWBIB17","series-title":"Electronic Notes in Discrete Mathematics, 10","article-title":"Analysing Greedy Algorithms on Regular Graphs","author":"Wormald","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810156?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:53:53Z","timestamp":1549173233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":17,"alternative-id":["S1571066104810156"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81015-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}