{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:07Z","timestamp":1753893787320,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm, is analysed on random $n$-vertex cubic graphs using differential equations. In this way, we prove that the expected size of the connected dominating set returned by the algorithm is asymptotically almost surely less than $0.5854n$.<\/jats:p>","DOI":"10.37236\/1624","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:27:22Z","timestamp":1578709642000},"source":"Crossref","is-referenced-by-count":4,"title":["Minimum Connected Dominating Sets of Random Cubic Graphs"],"prefix":"10.37236","volume":"9","author":[{"given":"W.","family":"Duckworth","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2002,2,14]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1r7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1r7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:15:31Z","timestamp":1579324531000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v9i1r7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2,14]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2002,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1624","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2002,2,14]]},"article-number":"R7"}}