{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:16:44Z","timestamp":1730247404673,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/icis.2013.6607889","type":"proceedings-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T18:38:45Z","timestamp":1380652725000},"page":"503-507","source":"Crossref","is-referenced-by-count":11,"title":["A polynomial-time algorithm for the maximum clique problem"],"prefix":"10.1109","author":[{"given":"Zohreh O.","family":"Akbari","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562186"},{"key":"18","first-page":"349","volume":"1","author":"de la fernandez vega","year":"1981","journal-title":"Bin Packing Can Be Solved Within 1 + in Linear Time"},{"journal-title":"The P-versus-NP Page","year":"2013","author":"woeginger","key":"24"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"journal-title":"A Frenzy Math Enters Age of Electronic Mail","year":"1990","author":"kolata","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0206038"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1984.10036"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289146"},{"key":"20","first-page":"265","article-title":"Universal search problems","volume":"9","author":"levin","year":"1973","journal-title":"Problems of Information Transmission"},{"key":"2","first-page":"389","article-title":"5. 3 Independent sets and cliques","author":"gutin","year":"2004","journal-title":"Discrete Math and its Applications Handbook of Graph Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00233-5"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.2307\/2088670"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289199"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.2307\/2785498"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1177\/001872674900200205"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.2307\/2785673"}],"event":{"name":"2013 IEEE\/ACIS 12th International Conference on Computer and Information Science (ICIS)","start":{"date-parts":[[2013,6,16]]},"location":"Niigata, Japan","end":{"date-parts":[[2013,6,20]]}},"container-title":["2013 IEEE\/ACIS 12th International Conference on Computer and Information Science (ICIS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6588696\/6607797\/06607889.pdf?arnumber=6607889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T20:11:36Z","timestamp":1490213496000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6607889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icis.2013.6607889","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}