{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:52:26Z","timestamp":1768337546248,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642046858","type":"print"},{"value":"9783642046865","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04686-5_30","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T06:59:43Z","timestamp":1254812383000},"page":"363-373","source":"Crossref","is-referenced-by-count":18,"title":["An Algorithm to Discover the k-Clique Cover in Networks"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cavique","sequence":"first","affiliation":[]},{"given":"Armando B.","family":"Mendes","sequence":"additional","affiliation":[]},{"given":"Jorge M. A.","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"R.D. Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology\u00a03, 113\u2013126 (1973)","journal-title":"Journal of Mathematical Sociology"},{"key":"30_CR2","unstructured":"Berners-Lee, T.: The Next Wave of the Web: Plenary Panel. In: 15th International World Wide Web Conference, WWW2006, Edinburgh, Scotland (2006)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Cavique, L., Luz, C.: A Heuristic for the Stability Number of a Graph based on Convex Quadratic Programming and Tabu Search, special issue of the Journal of Mathematical Sciences, Aveiro Seminar on Control Optimization and Graph Theory, Second Series (to appear, 2009)","DOI":"10.1007\/s10958-009-9613-x"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4615-1507-4_11","volume-title":"Essays and Surveys in Metaheuristics","author":"L. Cavique","year":"2002","unstructured":"Cavique, L., Rego, C., Themido, I.: A Scatter Search Algorithm for the Maximum Clique Problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 227\u2013244. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"30_CR5","first-page":"233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res.\u00a04, 233\u2013235 (1979)","journal-title":"Oper. Res."},{"key":"30_CR6","volume-title":"Mining Graph Data","year":"2007","unstructured":"Cook, D.J., Holder, L.B. (eds.): Mining Graph Data. John Wiley & Sons, New Jersey (2007)"},{"key":"30_CR7","unstructured":"DIMACS: Maximum clique, graph coloring, and satisfiability, Second DIMACS implementation challenge (1995), http:\/\/dimacs.rutgers.edu\/Challenges\/ (accessed April 2009)"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On Random Graphs. I. Publicationes Mathematicae\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: SIGCOMM, pp. 251\u2013262 (1999)","DOI":"10.1145\/316194.316229"},{"issue":"6","key":"30_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest Path. Communications of the ACM\u00a05(6), 345 (1962)","journal-title":"Communications of the ACM"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-006-0017-8","volume":"144","author":"M. Gomes","year":"2006","unstructured":"Gomes, M., Cavique, L., Themido, I.: The Crew Time Tabling Problem: an extension of the Crew Scheduling Problem. Annals of Operations Research, volume Optimization in transportation\u00a0144(1), 111\u2013132 (2006)","journal-title":"Annals of Operations Research, volume Optimization in transportation"},{"key":"30_CR12","unstructured":"Grossman, J., Ion, P., Castro, R.D.: The Erdos number Project (2007), http:\/\/www.oakland.edu\/enp\/ (accessed April 2009)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Science\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Science"},{"issue":"2","key":"30_CR14","first-page":"544","volume":"16","author":"E. Kellerman","year":"1973","unstructured":"Kellerman, E.: Determination of keyword conflict. IBM Technical Disclosure Bulletin\u00a016(2), 544\u2013546 (1973)","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02289199","volume":"15","author":"R.D. Luce","year":"1950","unstructured":"Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika\u00a015, 159\u2013190 (1950)","journal-title":"Psychometrika"},{"issue":"1","key":"30_CR16","first-page":"60","volume":"1","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The Small World Problem. Psychology Today\u00a01(1), 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R.J. Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans. Quality and Quantity\u00a013, 161\u2013173 (1979)","journal-title":"Quality and Quantity"},{"key":"30_CR18","volume-title":"Who Shall Survive?","author":"J.L. Moreno","year":"1934","unstructured":"Moreno, J.L.: Who Shall Survive? Nervous and Mental Disease Publishing Company, Washington DC (1934)"},{"key":"30_CR19","volume-title":"Social Network Analysis - A Handbook","author":"J. Scott","year":"2000","unstructured":"Scott, J.: Social Network Analysis - A Handbook. Sage Publications, London (2000)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Soriano, P., Gendreau, M.: Tabu search algorithms for the maximum clique. In: Johnson, D.S., Trick, M.A. (eds.) Clique, Coloring and Satisfiability, Second Implementation Challenge DIMACS, pp. 221\u2013242 (1996)","DOI":"10.1090\/dimacs\/026\/12"},{"key":"30_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"issue":"6684","key":"30_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature\u00a0393(6684), 409\u2013410 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04686-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T01:56:16Z","timestamp":1685152576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04686-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046858","9783642046865"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04686-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}