{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:28Z","timestamp":1725540688042},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_1","type":"book-chapter","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T23:32:11Z","timestamp":1356046331000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on Quasi-Completeness"],"prefix":"10.1007","author":[{"given":"Malay","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghamitra","family":"Bandyopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive Quasi-Clique Detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1137\/0122052","volume":"22","author":"A.T. Amin","year":"1972","unstructured":"Amin, A.T., Hakimi, S.L.: Upper bounds on the order of a clique of a graph. SIAM J. Appl. Math.\u00a022, 569\u2013573 (1972)","journal-title":"SIAM J. Appl. Math."},{"issue":"1-2","key":"1_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2009-164","volume":"96","author":"S. Bandyopadhyay","year":"2009","unstructured":"Bandyopadhyay, S., Bhattacharyya, M.: Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph. Fund. Inform.\u00a096(1-2), 1\u201325 (2009)","journal-title":"Fund. Inform."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/9780470872352.ch16","volume-title":"Computational Intelligence and Pattern Analysis in Biological Informatics","author":"M. Bhattacharyya","year":"2010","unstructured":"Bhattacharyya, M., Bandyopadhyay, S.: Analyzing Topological Properties of Protein-protein Interaction Networks: A Perspective towards Systems Biology. In: Computational Intelligence and Pattern Analysis in Biological Informatics, pp. 349\u2013368. John Wiley & Sons, Inc., Hoboken (2010)"},{"key":"1_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol.\u00a0184. Springer, New York (1998)"},{"key":"1_CR6","first-page":"1","volume-title":"Handbook of Combinatorial Optimization: Supplementary Volume A","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization: Supplementary Volume A, pp. 1\u201374. Kluwer Academic, Dordrecht (1999)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Patt-Shamir, B.: Distributed discovery of large near-cliques In: Proceedings of the 23rd International Conference on Distributed Computing, Elche, Spain, pp. 206\u2013220 (2009)","DOI":"10.1007\/978-3-642-04355-0_22"},{"key":"1_CR8","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2009","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2009)"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D. Jiang","year":"2009","unstructured":"Jiang, D., Pei, J.: Mining Frequent Cross-Graph Quasi-Cliques. ACM Trans. Knowl. Discov. Data\u00a02(4), 16 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On Mining Cross-Graph Quasi-Cliques. In: Proceedings of the 11th ACM SIGKDD, Chicago, Illinois, USA, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:33:44Z","timestamp":1620120824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}