{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:47Z","timestamp":1725678107745},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_55","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"594-603","source":"Crossref","is-referenced-by-count":0,"title":["A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Neh\u00e9z","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Olej\u00e1r","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Demetrian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The probabilistic method, 2nd edn. John Wiley & Sons, New York (2000)","edition":"2"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathmatics, 73 (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"55_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in random graphs. Math. Proc. Cam. Phil. Soc.\u00a080, 419\u2013427 (1976)","journal-title":"Math. Proc. Cam. Phil. Soc."},{"key":"55_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-10631-6_3","volume-title":"Algorithms and Computation","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.T.: Exact Algorithms for Dominating Clique Problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 4\u201313. Springer, Heidelberg (2009)"},{"key":"55_CR5","unstructured":"Culberson, J.C., Gao, Y., Anton, C.: Phase Transitions of Dominating Clique Problem and Their Implic\u00e1tions to Heuristics in Satisfiability Search. In: Proc. 19th Int. Joint Conf. on Artificial Intelligence, IJCAI 2005, pp. 78\u201383, 2205\u20132222 (2005)"},{"key":"55_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press (2003)","DOI":"10.1201\/9780203490204"},{"key":"55_CR8","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"55_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., Luczak, T., Rucinski, A.: Random Graphs. John Wiley & Sons, New York (2000)"},{"key":"55_CR10","unstructured":"Kalbfleisch, J.G.: Complete subgraphs of random hypergraphs and bipartite graphs. In: Proc. 3rd Southeastern Conf. of Combinatorics, Graph Theory and Computing, pp. 297\u2013304. Florida Atlantic University (1972)"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2007.06.014","volume":"385","author":"D. Kratsch","year":"2007","unstructured":"Kratsch, D., Liedloff, M.: An exact algorithm for the minimum dominating clique problem. Theoretical Computer Science\u00a0385, 226\u2013240 (2007)","journal-title":"Theoretical Computer Science"},{"key":"55_CR12","unstructured":"Matula, D.W.: The largest clique size in a random graph, Technical report CS 7608, Dept. of Comp. Sci. Southern Methodist University, Dallas (1976)"},{"key":"55_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11602613_53","volume-title":"Algorithms and Computation","author":"M. Neh\u00e9z","year":"2005","unstructured":"Neh\u00e9z, M., Olej\u00e1r, D.: An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 524\u2013532. Springer, Heidelberg (2005)"},{"key":"55_CR14","unstructured":"Neh\u00e9z, M., Olej\u00e1r, D.: On Dominating Cliques in Random Graphs, Research Report, KAM-Dimatia Series 2005-750, Charles University, Prague (2005)"},{"key":"55_CR15","unstructured":"Neh\u00e9z, M., Olej\u00e1r, D., Demetrian, M.: On Emergence of Dominating Cliques in Random Graphs In: LUMS 2nd Int. Conference on Mathematics and its Applications in Inform. Technology, Lahore, Pakistan, p. 59. Book of Abstracts (2008)"},{"issue":"5","key":"55_CR16","first-page":"499","volume":"47","author":"D. Olej\u00e1r","year":"1997","unstructured":"Olej\u00e1r, D., Toman, E.: On the Order and the Number of Cliques in a Random Graph. Math. Slovaca\u00a047(5), 499\u2013510 (1997)","journal-title":"Math. Slovaca"},{"key":"55_CR17","volume-title":"Graphical Evolution","author":"E.M. Palmer","year":"1985","unstructured":"Palmer, E.M.: Graphical Evolution. John Wiley & Sons, Inc., New York (1985)"},{"key":"55_CR18","first-page":"113","volume":"153","author":"D. Ramras","year":"2001","unstructured":"Ramras, D., Greenberg, S., Godbole, A.P.: Cliques and Independent Neighbor Sets in Random Graphs. Congressus Numerantium\u00a0153, 113\u2013128 (2001)","journal-title":"Congressus Numerantium"},{"issue":"1","key":"55_CR19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.37236\/1581","volume":"8","author":"B. Wieland","year":"2001","unstructured":"Wieland, B., Godbole, A.P.: On the Domination Number of a Random Graph. Electronic Journal of Combinatorics\u00a08(1), #R37(2001)","journal-title":"Electronic Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:06Z","timestamp":1620127386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}