{"id":"https://openalex.org/W2078408284","doi":"https://doi.org/10.1109/tevc.2014.2338076","title":"An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space","display_name":"An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space","publication_year":2014,"publication_date":"2014-07-10","ids":{"openalex":"https://openalex.org/W2078408284","doi":"https://doi.org/10.1109/tevc.2014.2338076","mag":"2078408284"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2014.2338076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2014.2338076","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","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/A5075875574","display_name":"Kisung Seo","orcid":"https://orcid.org/0000-0002-5256-0582"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]},{"id":"https://openalex.org/I55188197","display_name":"Seokyeong University","ror":"https://ror.org/04x0k0m51","country_code":"KR","type":"education","lineage":["https://openalex.org/I55188197"]}],"countries":["KR","US"],"is_corresponding":true,"raw_author_name":"Kisung Seo","raw_affiliation_strings":["Department of Electronics Engineering, Seokyeong University, Seoul, Korea","Michigan State University, East Lansing, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, Seokyeong University, Seoul, Korea","institution_ids":["https://openalex.org/I55188197"]},{"raw_affiliation_string":"Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020992753","display_name":"Soohwan Hyun","orcid":null},"institutions":[{"id":"https://openalex.org/I186506485","display_name":"Hyundai Heavy Industries (South Korea)","ror":"https://ror.org/0433haa75","country_code":"KR","type":"company","lineage":["https://openalex.org/I186506485"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soohwan Hyun","raw_affiliation_strings":["Hyundai Heavy Industries Research Institute, Yongin, Korea"],"affiliations":[{"raw_affiliation_string":"Hyundai Heavy Industries Research Institute, Yongin, Korea","institution_ids":["https://openalex.org/I186506485"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046031351","display_name":"Yong-Hyuk Kim","orcid":"https://orcid.org/0000-0002-0492-0889"},"institutions":[{"id":"https://openalex.org/I161024014","display_name":"Kwangwoon University","ror":"https://ror.org/02e9zc863","country_code":"KR","type":"education","lineage":["https://openalex.org/I161024014"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yong-Hyuk Kim","raw_affiliation_strings":["Department of Computer Science and Engineering, Kwangwoon University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kwangwoon University, Seoul, Korea","institution_ids":["https://openalex.org/I161024014"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075875574"],"corresponding_institution_ids":["https://openalex.org/I55188197","https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":1.6361,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.8747577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"19","issue":"4","first_page":"465","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973999857902527,"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.9959999918937683,"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/spanning-tree","display_name":"Spanning tree","score":0.70196533203125},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6877293586730957},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5344260334968567},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5191828012466431},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.518036425113678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49572598934173584},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4915407598018646},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46199584007263184},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44906583428382874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43065422773361206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.415485143661499},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38340073823928833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2042851448059082},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1947137713432312}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.70196533203125},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6877293586730957},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5344260334968567},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5191828012466431},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.518036425113678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49572598934173584},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4915407598018646},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46199584007263184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44906583428382874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43065422773361206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.415485143661499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38340073823928833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2042851448059082},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1947137713432312},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tevc.2014.2338076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2014.2338076","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1920241907","display_name":null,"funder_award_id":"NRF-2011-0009958","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W17452554","https://openalex.org/W76082810","https://openalex.org/W155769578","https://openalex.org/W1486060839","https://openalex.org/W1563351955","https://openalex.org/W1574175429","https://openalex.org/W1586313388","https://openalex.org/W1596909887","https://openalex.org/W1604274909","https://openalex.org/W1761805795","https://openalex.org/W1874904312","https://openalex.org/W1933385826","https://openalex.org/W1966457471","https://openalex.org/W1969189142","https://openalex.org/W1983592887","https://openalex.org/W1984283136","https://openalex.org/W1985123706","https://openalex.org/W1991957444","https://openalex.org/W2007068104","https://openalex.org/W2011601876","https://openalex.org/W2011697549","https://openalex.org/W2013333763","https://openalex.org/W2024060531","https://openalex.org/W2030087828","https://openalex.org/W2033410081","https://openalex.org/W2039355939","https://openalex.org/W2042216983","https://openalex.org/W2042467140","https://openalex.org/W2045756072","https://openalex.org/W2058438487","https://openalex.org/W2062307640","https://openalex.org/W2075037955","https://openalex.org/W2079566417","https://openalex.org/W2081957612","https://openalex.org/W2086917808","https://openalex.org/W2097277086","https://openalex.org/W2110229765","https://openalex.org/W2117105073","https://openalex.org/W2124224099","https://openalex.org/W2125531986","https://openalex.org/W2159739530","https://openalex.org/W2161122238","https://openalex.org/W2169647400","https://openalex.org/W2175475058","https://openalex.org/W2312821511","https://openalex.org/W2313378460","https://openalex.org/W2327442755","https://openalex.org/W2401610261","https://openalex.org/W4238018361","https://openalex.org/W4250831670","https://openalex.org/W4297922645","https://openalex.org/W6600701498","https://openalex.org/W6629231857","https://openalex.org/W6633771127","https://openalex.org/W6640368482"],"related_works":["https://openalex.org/W2095166134","https://openalex.org/W2018213020","https://openalex.org/W1584377038","https://openalex.org/W2030879379","https://openalex.org/W1997194225","https://openalex.org/W2066567782","https://openalex.org/W1989698351","https://openalex.org/W2086134182","https://openalex.org/W2761026540","https://openalex.org/W2412875519"],"abstract_inverted_index":{"The":[0],"encoding":[1,31,53,67,87,98],"or":[2],"representation":[3],"scheme":[4,99,170],"in":[5,32,88,156,166],"evolutionary":[6,20],"algorithms":[7,21],"is":[8,110],"very":[9],"important":[10],"because":[11],"it":[12],"can":[13],"greatly":[14],"affect":[15],"their":[16],"performance.":[17],"Most":[18],"previous":[19],"for":[22],"solving":[23],"graph":[24],"problems":[25],"have":[26,129,146],"traditionally":[27],"used":[28,142],"a":[29,38,60,78,84,115,120,134,169,172],"vertex-based":[30,173],"which":[33,89,153],"each":[34,69,90],"gene":[35,70,91],"corresponds":[36,71,92],"to":[37,72,83,93,113],"vertex.":[39],"In":[40,65,81],"this":[41,125],"paper,":[42],"addressing":[43],"the":[44,56,101],"well-known":[45],"maximum":[46],"cut":[47],"problem,":[48],"we":[49],"introduce":[50],"an":[51,73],"edge-set":[52],"based":[54,123],"on":[55,124,133,150],"spanning":[57,79],"tree":[58],"-":[59],"kind":[61],"of":[62,103,137],"edge-based":[63,86],"encoding.":[64,127,174],"our":[66,97],"scheme,":[68],"edge":[74],"subset":[75],"derived":[76],"from":[77],"tree.":[80],"contrast":[82],"traditional":[85],"only":[94,105],"one":[95],"edge,":[96],"has":[100],"advantage":[102],"representing":[104],"feasible":[106],"solutions,":[107],"so":[108],"there":[109],"no":[111],"need":[112],"apply":[114],"repair":[116],"step.":[117],"We":[118,128],"present":[119],"genetic":[121],"algorithm":[122],"new":[126],"conducted":[130],"various":[131],"experiments":[132],"large":[135],"set":[136],"test":[138],"graphs":[139,144],"including":[140],"commonly":[141],"benchmark":[143],"and":[145,163],"obtained":[147],"performance":[148],"improvement":[149],"sparse":[151],"graphs,":[152],"frequently":[154],"appear":[155],"real-world":[157],"applications":[158],"such":[159],"as":[160],"social":[161],"networks":[162],"systems":[164],"biology,":[165],"comparison":[167],"with":[168],"using":[171]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}