{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:07:34Z","timestamp":1746288454865},"publisher-location":"Dordrecht","reference-count":22,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402087387"},{"type":"electronic","value":"9781402087394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-4020-8739-4_20","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T08:52:47Z","timestamp":1219135967000},"page":"112-116","source":"Crossref","is-referenced-by-count":1,"title":["NP-Hard Graph Problems\u2019 Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service"],"prefix":"10.1007","author":[{"given":"Deniss","family":"Kumlander","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Handbook of Combinatorial Optimization","author":"M. Bomze","year":"1999","unstructured":"M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, Handbook of Combinatorial Optimization (Kluwer Academic Publishers, Boston, MA, 1999)."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"R. Carraghan and P.M. Pardalos, \u201cAn exact algorithm for the maximum clique problem\u201d. Op. Research Letters, vol. 9, 1990, pp. 375-382.","journal-title":"Op. Research Letters"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"P.R.J. \u00d6sterg\u00e5rd, \u201cA fast algorithm for the maximum clique problem\u201d, Discrete Applied Mathematics, vol. 120, 2002, pp. 197-207.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1017557620292","volume":"109","author":"S. Butenko","year":"2001","unstructured":"S. Butenko, P. Festa, and P.M. Pardalos, \u201cOn the chromatic number of graphs\u201d, Journal of Optimization Theory and Applications, vol. 109, 2001, pp. 51-67.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"20_CR5","unstructured":"D.B. West, Introduction to Graph Theory (2nd edition) Prentice Hall, 2001."},{"issue":"8","key":"20_CR6","first-page":"1726","volume":"5","author":"D. Kumlander","year":"2006","unstructured":"D. Kumlander, \u201cImproving the maximum clique finding applications by using artificial intelligence principles\u201d, WSEAS Transactions on Computers, vol. 5(8), 2006, 1726-1732.","journal-title":"WSEAS Transactions on Computers"},{"key":"20_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness Freeman, New-York, 1979."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cooke, M.E. Hopkins, and P. Markstein, \u201cRegister allocation via coloring\u201d, Computer Languages, vol.. 6, 1981, pp. 47-57.","journal-title":"Computer Languages"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y. Azar","year":"2001","unstructured":"Y. Azar and O. Regev, \u201cOn-line bin stretching\u201d, Theoretical Computer Science, vol. 268, 2001, pp. 17-41.","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0304-3975(00)00260-7","volume":"268","author":"S. Bischof","year":"2001","unstructured":"S. Bischof and E.W. Mayr, \u201cOn-line scheduling of parallel jobs with runtime restrictions\u201d, Theoretical Computer Science, vol. 268, 2001, pp. 67-90.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"20_CR11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/2.362628","volume":"28","author":"D.J. Musliner","year":"1995","unstructured":"D.J. Musliner, J.A. Hendler, A.K. Agrawala, and E.H. Durfee, \u201cThe Challenges of Real-Time AI\u201d, IEEE Computer, vol. 28(1), 1995, pp. 58-66.","journal-title":"IEEE Computer"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, A Theoretician\u2019s Guide to the Experimental Analysis of Algorithms, in Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges American Mathematical Society, Providence, 2002.","DOI":"10.1090\/dimacs\/059\/11"},{"key":"20_CR13","unstructured":"D. Kumlander, \u201cAn approach for the maximum clique finding problem test tool software engineering\u201d, Proceedings of the IASTED International Conference on Software Engineering as part of the 25th IASTED International Multi-Confeence on Applied Informatics, Innsbruck, Austria, 2007, pp. 297\u2013301."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"D.S. Johnson and M.A. Trick, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"C. Berge and V. Chv\u2019atal, \u201cTopics on Perfect Graphs\u201d, Ann. Discrete Math., vol. 21, North-Holland, Amsterdam, 1984, pp. 193\u2014196.","DOI":"10.1016\/S0304-0208(08)72921-9"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(90)90180-6","volume":"36","author":"H. Kim","year":"1990","unstructured":"H. Kim, \u201cFinding a Maximum Independent Set in a Permutation Graph\u201d, Inf. Process. Lett. vol. 36(1), 1990, pp. 19-23.","journal-title":"Inf. Process. Lett"},{"key":"20_CR17","unstructured":"D. Kumlander, \u201cComparing the best maximum clique finding algorithms, which are using heuristic vertex colouring\u201d, Proceedings on the 10th WSEAS International Conference on Computers, 2006, pp. 932-937."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"D. Kumlander, \u201cProblems of optimization: an exact algorithm for finding a maximum clique optimized for dense graphs\u201d, Proceedings of the Estonian Academy of Sciences Phys. Math., vol. 54(2), 2005, pp. 79-86.","DOI":"10.3176\/phys.math.2005.2.02"},{"key":"20_CR19","unstructured":"D. Kumlander, \u201cOn places suitable for applying AI principles in NP-hard graph problems\u2019 algorithms\u201d, Proceedings of the IASTED Conference on Artificial Intelligence and Applications as part of the 25th IASTED International Multi-Conference on Applied Informatics, Innsbruck, Austria, 2007, pp. 284 - 288."},{"key":"20_CR20","unstructured":"D. Kumlander, \u201cIncomplete solution approach for the maximum clique finding in the real-time systems\u201d, Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications, Innsbruck, Austria, 2006, pp. 75-79."},{"key":"20_CR21","unstructured":"D. Kumlander, \u201cArtificial intelligence in the maximum clique finding problem applications\u201d, Proceedings on the 7th WSEAS International Conference on Automation and Information, 2006, pp. 132-137."},{"key":"20_CR22","unstructured":"D. Kumlander, \u201dApplying AI and incomplete solution principles to solve NP-hard problems in the real-time systems\u201d, Proceedings on the 10th WSEAS International Conference on Computers, 2006, pp. 807-811."}],"container-title":["Innovative Techniques in Instruction Technology, E-learning, E-assessment, and Education"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-8739-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T17:08:52Z","timestamp":1684516132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-8739-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781402087387","9781402087394"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-8739-4_20","relation":{},"subject":[]}}