{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:28Z","timestamp":1725484288707},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_24","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"210-219","source":"Crossref","is-referenced-by-count":2,"title":["On the Connected Domination Number of Random Regular Graphs"],"prefix":"10.1007","author":[{"given":"William","family":"Duckworth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N. Alon","year":"1990","unstructured":"Alon, N.: Transversal Numbers of Uniform Hypergraphs. Graphs and Combinatorics 6(1) (1990) 1\u20134","journal-title":"Graphs and Combinatorics"},{"key":"24_CR2","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press (1985)"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"T. Caro","year":"2000","unstructured":"Caro, T., West, D.B. and Yuster, R.: Connected Domination and Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 13(2) (2000) 202\u2013211","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"24_CR4","unstructured":"Duckworth, W.: Greedy Algorithms and Cubic Graphs. PhD Thesis, Department of Mathematics and Statistics, The University of Melbourne (2001)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"crossref","first-page":"#R7","DOI":"10.37236\/1624","volume":"9","author":"W. Duckworth","year":"2002","unstructured":"Duckworth, W.: Minimum Connected Dominating Sets of Random Cubic Graphs. The Electronic Journal of Combinatorics, 9(1) (2002) #R7","journal-title":"The Electronic Journal of Combinatorics"},{"key":"24_CR6","unstructured":"Duckworth, W. and Wormald, N.C.: Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Submitted"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","volume":"52","author":"G. Galbiati","year":"1994","unstructured":"Galbiati, G., Maffioli, F. and Morzenti, A.: A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Information Processing Letters 52(1) (1994) 45\u201349","journal-title":"Information Processing Letters"},{"issue":"6","key":"24_CR8","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/jgt.3190130604","volume":"13","author":"J.R. Griggs","year":"1989","unstructured":"Griggs, J.R., Kleitman, D.J. and Shastri, A.: Spanning Trees with Many Leaves in Cubic Graphs. Journal of Graph Theory 13(6) (1989) 669\u2013695","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(92)90331-9","volume":"104","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R. and Wu, M.: Spanning Trees in Graphs of Minimum Degree 4 or 5. Discrete Mathematics 104(2) (1992) 167\u2013183","journal-title":"Discrete Mathematics"},{"key":"24_CR10","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T. and Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Solis-Oba, R.: 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of leaves. In: Proceedings of the 17th European Symposium on Algorithms, Springer (1998) 441\u2013452","DOI":"10.1007\/3-540-68530-8_37"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0020-0190(81)90141-1","volume":"13","author":"J.A. Storer","year":"1981","unstructured":"Storer, J.A.: Constructing Full Spanning Trees for Cubic Graphs. Information Processing Letters 13(1) (1981) 8\u201311","journal-title":"Information Processing Letters"},{"key":"24_CR13","unstructured":"Wormald, N.C.: Models of Random Regular Graphs. In: Surveys in Combinatorics, Cambridge University Press (1999) 239\u2013298"},{"key":"24_CR14","unstructured":"Wormald, N.C.: The Differential Equation Method for Random Graph Processes and Greedy Algorithms. In: Lectures on Approximation and Randomized Algorithms, PWN (1999) 73\u2013155"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T06:33:45Z","timestamp":1587537225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}