{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:36:18Z","timestamp":1725528978898},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540244011"},{"type":"electronic","value":"9783540305408"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30540-8_5","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T01:36:43Z","timestamp":1294969003000},"page":"44-57","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Induced Matchings of Random Regular Graphs"],"prefix":"10.1007","author":[{"given":"Hilda","family":"Assiyatun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Assiyatun, H.: Large Subgraphs of Regular Graphs, Doctoral Thesis, Department of Mathematics and Statistics, The University of Melbourne, Australia (2001)"},{"key":"5_CR2","unstructured":"Assiyatun, H., Duckworth, W.: Small Maximal Matchings of Random Cubic Graph (preprint)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-45687-2_9","volume-title":"Mathematical Foundations of Computer Science 2002","author":"M. Beis","year":"2002","unstructured":"Beis, M., Duckworth, W., Zito, M.: Packing Edges in Random Regular Graphs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 118\u2013130. Springer, Heidelberg (2002)"},{"key":"5_CR4","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1017\/CBO9780511662157.006","volume-title":"Combinatorics","author":"B. Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B.: Random Graphs. In: Temperley, H.N.V. (ed.) Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a052, pp. 80\u2013102. Cambridge University Press, Cambridge (1981)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron, K.: Induced Matchings. Discrete Applied Mathematics\u00a024, 97\u2013102 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0377-0427(01)00457-5","volume":"142","author":"W. Duckworth","year":"2002","unstructured":"Duckworth, W., Wormald, N.C., Zito, M.: Maximum Induced Matchings of Random Cubic Graph. The Journal of Computational and Applied Mathematics\u00a0142(1), 39\u201350 (2002)","journal-title":"The Journal of Computational and Applied Mathematics"},{"key":"5_CR7","unstructured":"Duckworth, W., Manlove, D., Zito, M.: On the Approximability of the Maximum Induced Matching Problem, Technical Report, TR-2000-56, Department of Computing Science of Glasgow University (2000)"},{"key":"5_CR8","unstructured":"Garmo, H.: Random Railways and Cycles in Random Regular Graphs, Doctoral Thesis, Uppsala University, Sweden (1998)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Lewenstein, M.: New results on induced matchings. Discrete Applied Mathematics\u00a0101, 157\u2013165 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","volume":"44","author":"M.C. Golumbic","year":"1993","unstructured":"Golumbic, M.C., Laskar, R.C.: Irredundancy in Circular Arc Graphs. Discrete Applied Mathematics\u00a044, 79\u201389 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<215::AID-JGT1>3.0.CO;2-V","volume":"23","author":"H.D. Robalewska","year":"1996","unstructured":"Robalewska, H.D.: 2-Factors in Random Regular Graphs. Journal of Graph Theory\u00a023(3), 215\u2013224 (1996)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S0963548300001735","volume":"4","author":"S. Janson","year":"1995","unstructured":"Janson, S.: Random Regular Graphs: Asymptotic Distributions and Contiguity. Combinatorics, Probability and Computing\u00a04(4), 369\u2013405 (1995)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/rsa.3240050209","volume":"5","author":"R.W. Robinson","year":"1994","unstructured":"Robinson, R.W., Wormald, N.C.: Almost All Regular Graphs are Hamiltonian. Random Structures and Algorithms\u00a05(2), 363\u2013374 (1994)","journal-title":"Random Structures and Algorithms"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/rsa.3240030202","volume":"3","author":"R.W. Robinson","year":"1992","unstructured":"Robinson, R.W., Wormald, N.C.: Almost All Cubic Graphs are Hamiltonian. Random Structures & Algorithms\u00a03, 117\u2013125 (1992)","journal-title":"Random Structures & Algorithms"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"L.J. Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Information Processing Letters\u00a015(1), 14\u201319 (1982)","journal-title":"Information Processing Letters"},{"key":"5_CR16","first-page":"239","volume-title":"Surveys in Combinatorics","author":"N.C. Wormald","year":"1999","unstructured":"Wormald, N.C.: Models of Random Regular Graphs. In: Surveys in Combinatorics, pp. 239\u2013298. Cambridge University Press, Cambridge (Canterbury 1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Geometry and Graph Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30540-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:45Z","timestamp":1619998005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30540-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244011","9783540305408"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30540-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}