{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:49Z","timestamp":1725552469826},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_54","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T09:53:05Z","timestamp":1271843585000},"page":"627-637","source":"Crossref","is-referenced-by-count":0,"title":["Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration"],"prefix":"10.1007","author":[{"given":"Kunal","family":"Dutta","sequence":"first","affiliation":[]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"The Probabilistic Method","year":"2001","author":"N. Alon","key":"54_CR1","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley International, Chichester (2001)"},{"key":"54_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambdrige University Press, Cambdrige (2001)","edition":"2"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in random graphs. Math. Proc. Camb. Phil. Soc.\u00a080, 419\u2013427 (1988)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0196-6774(82)90020-7","volume":"3","author":"B.K. Rosen","year":"1982","unstructured":"Rosen, B.K.: Robust linear algorithms for cutsets. J. Algorithms\u00a03, 205\u2013217 (1982)","journal-title":"J. Algorithms"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Assigning meaning to programs. In: Proc. Symp. Appl. Math., vol.\u00a019, pp. 19\u201332 (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"volume-title":"Computers and Intractability: A Guide To The Theory of NP-Completeness","year":"1978","author":"M.R. Garey","key":"54_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide To The Theory of NP-Completeness. W.H. Freeman, San Francisco (1978)"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0020-0190(98)00092-1","volume":"67","author":"M. Krivelevich","year":"1998","unstructured":"Krivelevich, M., Sudakov, B.: Coloring random graphs. Information Processing Letters\u00a067, 71\u201374 (1998)","journal-title":"Information Processing Letters"},{"key":"54_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. John Wiley & Sons, Inc., Chichester (2000)"},{"key":"54_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-56939-1_60","volume-title":"Automata, Languages and Programming","author":"C. Lund","year":"1993","unstructured":"Lund, C., Yannakakis, M.: The Approximation of Maximum Subgraph Problems. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 40\u201351. Springer, Heidelberg (1993)"},{"issue":"6","key":"54_CR10","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"M. Cai","year":"2001","unstructured":"Cai, M., Deng, X., Zang, W.: An Approximation Algorithm for Feedback Vertex Set in Tournaments. SIAM Journal of Computing\u00a030(6), 1993\u20132007 (2001)","journal-title":"SIAM Journal of Computing"},{"key":"54_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"3","key":"54_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science\u00a0351(3), 446\u2013458 (2006)","journal-title":"Theoretical Computer Science"},{"key":"54_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Speckenmeyer","year":"1990","unstructured":"Speckenmeyer, E.: On feedback problems in digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 218\u2013231. Springer, Heidelberg (1990)"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Subramanian, C.R.: Finding induced acyclic subgraphs in random digraphs. The Electronic Journal of Combinatorics\u00a010, R46 (2003)","DOI":"10.37236\/1739"},{"issue":"2","key":"54_CR15","first-page":"47","volume":"10","author":"J.H. Spencer","year":"2008","unstructured":"Spencer, J.H., Subramanian, C.R.: On the size of induced acyclic subgraphs in random digraphs. Disc. Math. and Theoret. Comp. Sci.\u00a010(2), 47\u201354 (2008)","journal-title":"Disc. Math. and Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:05:39Z","timestamp":1619769939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}