{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T16:58:31Z","timestamp":1764349111109},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,10,18]],"date-time":"2013-10-18T00:00:00Z","timestamp":1382054400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s11590-013-0698-2","type":"journal-article","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T06:22:20Z","timestamp":1381990940000},"page":"1611-1617","source":"Crossref","is-referenced-by-count":18,"title":["Solving maximum clique in sparse graphs: an $$O(nm+n2^{d\/4})$$ O ( n m + n 2 d \/ 4 ) algorithm for $$d$$ d -degenerate graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Austin","family":"Buchanan","sequence":"first","affiliation":[]},{"given":"Jose L.","family":"Walteros","sequence":"additional","affiliation":[]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,18]]},"reference":[{"key":"698_CR1","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: Graph Partitioning and Graph Clustering, vol. 588. American Mathematical Society, Providence (2013)","DOI":"10.1090\/conm\/588"},{"issue":"4","key":"698_CR2","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1209\/epl\/i2005-10574-3","volume":"74","author":"G Bianconi","year":"2006","unstructured":"Bianconi, G., Marsili, M.: Emergence of large cliques in random scale-free networks. Europhys. Lett. 74(4), 740 (2006)","journal-title":"Europhys. Lett."},{"key":"698_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, pp. 1\u201374. Springer, Berlin (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"698_CR4","doi-asserted-by":"crossref","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast algorithms for max independent set. Algorithmica. 62(1\u20132), 382\u2013415 (2012)","DOI":"10.1007\/s00453-010-9460-7"},{"issue":"9","key":"698_CR5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"6","key":"698_CR6","first-page":"726","volume":"57","author":"F Chung","year":"2010","unstructured":"Chung, F.: Graph theory in the information age. Notices AMS 57(6), 726\u2013732 (2010)","journal-title":"Notices AMS"},{"key":"698_CR7","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Algorithms and Computation, pp. 403\u2013414 (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"698_CR8","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: k-Degenerate graphs. Canad. J. Math 22, 1082\u20131096 (1970)","journal-title":"Canad. J. Math"},{"issue":"3","key":"698_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"698_CR10","unstructured":"Robson, J.M.: Finding a maximum independent set in time $${O}(2^{n\/4})$$ O ( 2 n \/ 4 ) . LaBRI, Universit\u00e9 de Bordeaux I, Technical report (2001)"},{"key":"698_CR11","unstructured":"Verma, A., Buchanan, A., Butenko, S.: Solving the maximum clique and vertex coloring problems on very large sparse networks. Working paper, Department of Industrial and Systems Engineering, Texas A &M University, College Station, TX (2012)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0698-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0698-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0698-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T22:41:25Z","timestamp":1564526485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0698-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,18]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["698"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0698-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,18]]}}}