{"id":"https://openalex.org/W4416912450","doi":"https://doi.org/10.1007/s42979-025-04538-5","title":"Maximum Independent Sets Using Hybrid Approach of Grey Wolf Optimizer and Genetic Algorithm","display_name":"Maximum Independent Sets Using Hybrid Approach of Grey Wolf Optimizer and Genetic Algorithm","publication_year":2025,"publication_date":"2025-12-02","ids":{"openalex":"https://openalex.org/W4416912450","doi":"https://doi.org/10.1007/s42979-025-04538-5"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-025-04538-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s42979-025-04538-5","pdf_url":null,"source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110447846","display_name":"R. S. Verma","orcid":"https://orcid.org/0009-0009-0730-0130"},"institutions":[{"id":"https://openalex.org/I36909309","display_name":"National Institute of Technology Hamirpur","ror":"https://ror.org/01nc8zs04","country_code":"IN","type":"education","lineage":["https://openalex.org/I36909309","https://openalex.org/I4210152752"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ritika Verma","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology Hamirpur, Hamirpur, Himachal Pradesh, 177 005, India"],"raw_orcid":"https://orcid.org/0009-0009-0730-0130","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology Hamirpur, Hamirpur, Himachal Pradesh, 177 005, India","institution_ids":["https://openalex.org/I36909309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028273329","display_name":"Dharmendra Prasad Mahato","orcid":"https://orcid.org/0000-0002-1847-0524"},"institutions":[{"id":"https://openalex.org/I36909309","display_name":"National Institute of Technology Hamirpur","ror":"https://ror.org/01nc8zs04","country_code":"IN","type":"education","lineage":["https://openalex.org/I36909309","https://openalex.org/I4210152752"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dharmendra Prasad Mahato","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology Hamirpur, Hamirpur, Himachal Pradesh, 177 005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology Hamirpur, Hamirpur, Himachal Pradesh, 177 005, India","institution_ids":["https://openalex.org/I36909309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110447846"],"corresponding_institution_ids":["https://openalex.org/I36909309"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30826687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"8","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.45239999890327454,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.45239999890327454,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1931000053882599,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.06830000132322311,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6578999757766724},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5364999771118164},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5339999794960022},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.45969998836517334},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4287000000476837},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41760000586509705},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4115000069141388},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3865000009536743}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6578999757766724},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5339999794960022},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49459999799728394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4706999957561493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47049999237060547},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.45969998836517334},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4187999963760376},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41760000586509705},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3865000009536743},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36010000109672546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.3264999985694885},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.31310001015663147},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s42979-025-04538-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s42979-025-04538-5","pdf_url":null,"source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W9668326","https://openalex.org/W14070459","https://openalex.org/W1971756951","https://openalex.org/W2000938428","https://openalex.org/W2004389974","https://openalex.org/W2009147258","https://openalex.org/W2052811387","https://openalex.org/W2061438946","https://openalex.org/W2069569782","https://openalex.org/W2073025989","https://openalex.org/W2078289947","https://openalex.org/W2082603400","https://openalex.org/W2147408677","https://openalex.org/W2294347342","https://openalex.org/W2401610261","https://openalex.org/W2586381853","https://openalex.org/W2738712979","https://openalex.org/W2770073247","https://openalex.org/W2913446257","https://openalex.org/W2997520071","https://openalex.org/W3178089624","https://openalex.org/W4211250195","https://openalex.org/W4232896595","https://openalex.org/W4251769540","https://openalex.org/W4280541727","https://openalex.org/W4313643779","https://openalex.org/W4316652274","https://openalex.org/W4379208028","https://openalex.org/W4398142453","https://openalex.org/W4400288391","https://openalex.org/W4406362389","https://openalex.org/W4408237460","https://openalex.org/W4409203733","https://openalex.org/W4409203751","https://openalex.org/W4410251011","https://openalex.org/W4412258646"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-12-02T00:00:00"}