{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:31:56Z","timestamp":1780954316223,"version":"3.54.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031877681","type":"print"},{"value":"9783031877698","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-87769-8_8","type":"book-chapter","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:37:21Z","timestamp":1743993441000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing Search Strategies for\u00a0Maximum Independent Set with\u00a0Grey Wolf Optimization-Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Ritika","family":"Verma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dharmendra","family":"Prasad Mahato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,8]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"CC Aggarwal","year":"1997","unstructured":"Aggarwal, C.C., Orlin, J.B., Tai, R.P.: Optimized crossover for the independent set problem. Oper. Res. 45(2), 226\u2013234 (1997)","journal-title":"Oper. Res."},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567\u2013583 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90019-2","journal-title":"J. Algorithms"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Back, T., Khuri, S.: An evolutionary heuristic for the maximum independent set problem. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE World Congress on Computational Intelligence, pp. 531\u2013535. IEEE (1994)","DOI":"10.1109\/ICEC.1994.350004"},{"key":"8_CR4","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th dimacs implementation challenge-graph partitioning and graph clustering. Georgia Institute of Technology, Georgia (2011)"},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42(5), 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"T Gallai","year":"1959","unstructured":"Gallai, T., et al.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"8_CR7","unstructured":"Leguizam\u00f3n, G., Michalewicz, Z., Schutz, M.: An ant system for the maximum independent set problem. In: VII Congreso Argentino de Ciencias de la Computaci\u00f3n (2001)"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Liu, X., Sakamoto, A., Shimamoto, T.: A genetic algorithm for maximum independent set problems. In: 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No. 96CH35929), vol.\u00a03, pp. 1916\u20131921 (1996). https:\/\/doi.org\/10.1109\/ICSMC.1996.565404","DOI":"10.1109\/ICSMC.1996.565404"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 1\u201310. Association for Computing Machinery, New York, NY, USA (1985). https:\/\/doi.org\/10.1145\/22145.22146","DOI":"10.1145\/22145.22146"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-87769-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:37:25Z","timestamp":1743993445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-87769-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031877681","9783031877698"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-87769-8_8","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"value":"2367-4512","type":"print"},{"value":"2367-4520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}