{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:16:18Z","timestamp":1742922978587,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":12,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402087400"},{"type":"electronic","value":"9781402087417"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-1-4020-8741-7_14","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T16:51:59Z","timestamp":1218473519000},"page":"74-78","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph"],"prefix":"10.1007","author":[{"given":"A. S.","family":"Bavan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Brayton, R. K., Hachtel, G. D., Sangiovanni- Vincentelli, A. L., Multilevel Logic Synthesis, Proc. IEEE, Vol. 78, No. 2, February 1990, pp.264-300.","DOI":"10.1109\/5.52213"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C. S., Finding a Maximal clique in an Arbitrary Graph, SIAM J. Computing 15(4), 1986, pp.1054-1068.","journal-title":"SIAM J. Computing"},{"key":"14_CR3","volume-title":"Graph Colourings","author":"N. Biggs","year":"1990","unstructured":"Biggs, N., Some Heuristics for Graph Coloring, in : R. Nelson and R. J. Wilson, eds, Graph Colourings, Longman, New York, 1990."},{"issue":"9","key":"14_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J., Finding all Cliques of an Undirected Graph, Comm. ACM 16(9), 1973, pp. 575-577.","journal-title":"Comm. ACM"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P. M., An Exact Algorithm for the Maximum Clique Problem, Operational Research Letters. 9, 1990, pp.375-382.","journal-title":"Operational Research Letters"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Franklin, M., Saluja, K. K., Hypergraph Coloring and Reconfigured RAM testing, IEEE Transactions on Computers, Vol. 43, No.6, June 1994, pp. 725-736.","DOI":"10.1109\/12.286305"},{"key":"14_CR7","unstructured":"Garey, M. R., Johnson, D. S., Computers and Interactability: A guide to the Theory of NP-Completeness, Freeman, 1979."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Lengauer, T., Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, 1990.","DOI":"10.1007\/978-3-322-92106-2"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rappe, J., Resende, M.G.C., An Exact Parallel Algorithm for the Maximum Clique Problem, High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone, Murl\u2019i, P.M. Pardalos and G. Toraldo (eds.), Kluwer, Dordrecht, 1998, pp. 279-300.","DOI":"10.1007\/978-1-4613-3279-4_18"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J., The Maximum Clique Problem, J. Global Optimization, 4, 1994, pp. 301- 328.","journal-title":"J. Global Optimization"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D.R. Wood","year":"1997","unstructured":"Wood, D. R., An Algorithm for Finding a Maximum Clique in a Graph, Operational Research Letters, 21, 1997, pp. 211-217.","journal-title":"Operational Research Letters"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"R.E. Tarjan","year":"1977","unstructured":"Tarjan, R. E., Trojanowski, A. E., Finding a Maximum Independent Set, SIAM J. Computing 6(3), 1977, pp. 537-546.","journal-title":"SIAM J. Computing"}],"container-title":["Advances in Computer and Information Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-8741-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T19:11:36Z","timestamp":1676056296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4020-8741-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9781402087400","9781402087417"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-8741-7_14","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}