{"id":"https://openalex.org/W4388893722","doi":"https://doi.org/10.1109/tencon58879.2023.10322484","title":"Solving Dense Subgraph Problems Using Genetic Algorithm","display_name":"Solving Dense Subgraph Problems Using Genetic Algorithm","publication_year":2023,"publication_date":"2023-10-31","ids":{"openalex":"https://openalex.org/W4388893722","doi":"https://doi.org/10.1109/tencon58879.2023.10322484"},"language":"en","primary_location":{"id":"doi:10.1109/tencon58879.2023.10322484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon58879.2023.10322484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2023 - 2023 IEEE Region 10 Conference (TENCON)","raw_type":"proceedings-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/A5009808828","display_name":"Joseph L. Pachuau","orcid":null},"institutions":[{"id":"https://openalex.org/I151903974","display_name":"National Institute Of Technology Silchar","ror":"https://ror.org/001ws2a36","country_code":"IN","type":"education","lineage":["https://openalex.org/I151903974"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Joseph L Pachuau","raw_affiliation_strings":["National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010","institution_ids":["https://openalex.org/I151903974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066035527","display_name":"Nongmeikapam Brajabidhu Singh","orcid":"https://orcid.org/0000-0002-4454-1568"},"institutions":[{"id":"https://openalex.org/I151903974","display_name":"National Institute Of Technology Silchar","ror":"https://ror.org/001ws2a36","country_code":"IN","type":"education","lineage":["https://openalex.org/I151903974"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nongmeikapam Brajabidhu Singh","raw_affiliation_strings":["National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010","institution_ids":["https://openalex.org/I151903974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072932633","display_name":"Laiphrakpam Dolendro Singh","orcid":"https://orcid.org/0000-0001-6169-4200"},"institutions":[{"id":"https://openalex.org/I151903974","display_name":"National Institute Of Technology Silchar","ror":"https://ror.org/001ws2a36","country_code":"IN","type":"education","lineage":["https://openalex.org/I151903974"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Laiphrakpam Dolendro Singh","raw_affiliation_strings":["National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010","institution_ids":["https://openalex.org/I151903974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087503069","display_name":"Anish Kumar Saha","orcid":"https://orcid.org/0000-0002-3736-9632"},"institutions":[{"id":"https://openalex.org/I151903974","display_name":"National Institute Of Technology Silchar","ror":"https://ror.org/001ws2a36","country_code":"IN","type":"education","lineage":["https://openalex.org/I151903974"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anish Kumar Saha","raw_affiliation_strings":["National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010","institution_ids":["https://openalex.org/I151903974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2246,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53062581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"674","last_page":"679"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9940999746322632,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8842111825942993},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7250043153762817},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5772284269332886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5349916815757751},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5303172469139099},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5267053246498108},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49005186557769775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4817126393318176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4456077516078949},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4310758709907532},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.426360547542572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41487547755241394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3677639961242676},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27920815348625183},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17123177647590637},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.14307355880737305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07892519235610962},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06048321723937988}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8842111825942993},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7250043153762817},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5772284269332886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5349916815757751},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5303172469139099},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5267053246498108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49005186557769775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4817126393318176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4456077516078949},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4310758709907532},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.426360547542572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41487547755241394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3677639961242676},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27920815348625183},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17123177647590637},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.14307355880737305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07892519235610962},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06048321723937988}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tencon58879.2023.10322484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon58879.2023.10322484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2023 - 2023 IEEE Region 10 Conference (TENCON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1519039476","https://openalex.org/W1535144194","https://openalex.org/W1568419559","https://openalex.org/W1587744656","https://openalex.org/W2007362596","https://openalex.org/W2013469283","https://openalex.org/W2016405275","https://openalex.org/W2036836182","https://openalex.org/W2047480303","https://openalex.org/W2047923585","https://openalex.org/W2095105189","https://openalex.org/W2121526866","https://openalex.org/W2123963758","https://openalex.org/W2136850043","https://openalex.org/W2163932787","https://openalex.org/W2169647400","https://openalex.org/W2266714125","https://openalex.org/W2946138166","https://openalex.org/W3005673592","https://openalex.org/W3042137000","https://openalex.org/W3046976269","https://openalex.org/W3101796089","https://openalex.org/W3132397175","https://openalex.org/W3137214761","https://openalex.org/W4223520979","https://openalex.org/W4312163572","https://openalex.org/W4313172799","https://openalex.org/W4375948377","https://openalex.org/W4385282420","https://openalex.org/W6604687372","https://openalex.org/W6633953436","https://openalex.org/W6636143309","https://openalex.org/W6791652774","https://openalex.org/W6847502607"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W1512756268","https://openalex.org/W4285101991","https://openalex.org/W2566098902","https://openalex.org/W872425053","https://openalex.org/W3151217588"],"abstract_inverted_index":{"In":[0],"graph":[1,27,45],"theory,":[2],"the":[3,10,29,34,40,54,60,111,115],"dense":[4,55],"subgraph":[5,12,18,56,109],"problem":[6,70,94,99],"aims":[7],"at":[8],"finding":[9,53],"densest":[11],"for":[13],"a":[14,22,25,86,96,101,108,136],"given":[15,112],"graph.":[16,113],"The":[17,93,126],"is":[19,31,57,64,67,76,95,129],"defined":[20],"as":[21,33,38,59],"subset":[23],"of":[24,36,42,62,110],"large":[26,50],"and":[28,49,71,117],"density":[30],"calculated":[32],"number":[35,41,61],"edges":[37],"per":[39],"vertices.":[43],"Real-life":[44],"networks":[46],"are":[47,119],"complicated":[48],"in":[51,72],"size;":[52],"difficult":[58],"subgraphs":[63],"numerous.":[65],"It":[66],"an":[68,80],"NP-hard":[69],"most":[73],"cases,":[74],"it":[75],"infeasible":[77],"to":[78,90,121,131],"find":[79],"exact":[81],"solution.":[82],"Here":[83],"we":[84],"propose":[85],"genetic":[87],"algorithm":[88,128],"approach":[89],"solve":[91],"it.":[92],"combinatorial":[97],"optimization":[98],"with":[100],"constraint":[102],"that":[103],"all":[104],"solutions":[105],"must":[106],"be":[107],"Here,":[114],"crossover":[116],"mutation":[118],"designed":[120],"produce":[122],"only":[123],"feasible":[124],"solutions.":[125],"proposed":[127],"able":[130],"give":[132],"close":[133],"approximation":[134],"within":[135],"reasonable":[137],"time.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}