{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:15:49Z","timestamp":1776122149846,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540926948","type":"print"},{"value":"9783540926955","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_4","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"41-55","source":"Crossref","is-referenced-by-count":46,"title":["On Effectively Finding Maximal Quasi-cliques in Graphs"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Brunato","sequence":"first","affiliation":[]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Battiti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H. Matsuda","year":"1999","unstructured":"Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoretical Computer Science\u00a0210(2), 305\u2013325 (1999)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M., Sudarsky, S.: Massive quasi-clique detection. In: Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN), pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Conference on Knowledge Discovery in Data, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Serrano, M., Bogu\u00f1\u00e1, M.: Clustering in complex networks. I. General formalism. Arxiv preprint cond-mat\/0608336 (2006)","DOI":"10.1103\/PhysRevE.74.056114"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Khan, O., Kulis, B., Selman, B.: Tracking evolving communities in large linked networks (2004)","DOI":"10.1145\/956750.956816"},{"issue":"7043","key":"4_CR6","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"1","key":"4_CR7","first-page":"49","volume":"21","author":"M. Everett","year":"1998","unstructured":"Everett, M., Borgatti, S.: Analyzing clique overlap. Connections\u00a021(1), 49\u201361 (1998)","journal-title":"Connections"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Xu, L., Wang, B., Pei, X.: A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network. In: Sixth IEEE International Conference on Data Mining Workshops, ICDM Workshops 2006, pp. 320\u2013324 (2006)","DOI":"10.1109\/ICDMW.2006.17"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W. Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research\u00a025, 159\u2013185 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R. Battiti","year":"2001","unstructured":"Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica\u00a029(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"4_CR11","unstructured":"Battiti, R., Mascia, F.: Reactive local search for maximum clique: a new implementation. Technical Report DIT-07-018, University of Trento (2007)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search - part i. ORSA Journal on Computing\u00a01(3), 190\u2013260 (1989)","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search - part ii. ORSA Journal on Computing\u00a02(1), 4\u201332 (1990)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10878-006-9635-y","volume":"12","author":"W. Pullan","year":"2006","unstructured":"Pullan, W.: Phased local search for the maximum clique problem. Journal of Combinatorial Optimization\u00a012(3), 303\u2013323 (2006)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T09:21:57Z","timestamp":1557998517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}