{"id":"https://openalex.org/W1987082714","doi":"https://doi.org/10.1109/icdim.2013.6693966","title":"Genetic programming based degree constrained spanning tree extraction","display_name":"Genetic programming based degree constrained spanning tree extraction","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W1987082714","doi":"https://doi.org/10.1109/icdim.2013.6693966","mag":"1987082714"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2013.6693966","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2013.6693966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Digital Information Management (ICDIM 2013)","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/A5101730630","display_name":"Zaheer Babar","orcid":"https://orcid.org/0000-0003-3664-8901"},"institutions":[{"id":"https://openalex.org/I5400463","display_name":"Ghulam Ishaq Khan Institute of Engineering Sciences and Technology","ror":"https://ror.org/01sb6ek09","country_code":"PK","type":"education","lineage":["https://openalex.org/I5400463"]}],"countries":["PK"],"is_corresponding":true,"raw_author_name":"Zaheer Babar","raw_affiliation_strings":["GIK Institute, Topi, Pakistan","GIK Inst., Topi, Pakistan"],"affiliations":[{"raw_affiliation_string":"GIK Institute, Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]},{"raw_affiliation_string":"GIK Inst., Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086533220","display_name":"Muhammad Waqas","orcid":"https://orcid.org/0000-0003-0814-7544"},"institutions":[{"id":"https://openalex.org/I5400463","display_name":"Ghulam Ishaq Khan Institute of Engineering Sciences and Technology","ror":"https://ror.org/01sb6ek09","country_code":"PK","type":"education","lineage":["https://openalex.org/I5400463"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muhammad Waqas","raw_affiliation_strings":["GIK Institute, Topi, Pakistan","GIK Inst., Topi, Pakistan"],"affiliations":[{"raw_affiliation_string":"GIK Institute, Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]},{"raw_affiliation_string":"GIK Inst., Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047996342","display_name":"Zahid Halim","orcid":"https://orcid.org/0000-0003-3094-3483"},"institutions":[{"id":"https://openalex.org/I5400463","display_name":"Ghulam Ishaq Khan Institute of Engineering Sciences and Technology","ror":"https://ror.org/01sb6ek09","country_code":"PK","type":"education","lineage":["https://openalex.org/I5400463"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Zahid Halim","raw_affiliation_strings":["GIK Institute, Topi, Pakistan","GIK Inst., Topi, Pakistan"],"affiliations":[{"raw_affiliation_string":"GIK Institute, Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]},{"raw_affiliation_string":"GIK Inst., Topi, Pakistan","institution_ids":["https://openalex.org/I5400463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022868397","display_name":"Muhammad Arshad Islam","orcid":"https://orcid.org/0000-0002-7503-5086"},"institutions":[{"id":"https://openalex.org/I23805111","display_name":"Mohammad Ali Jinnah University","ror":"https://ror.org/02xx4jg88","country_code":"PK","type":"education","lineage":["https://openalex.org/I23805111"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muhammad Arshad Islam","raw_affiliation_strings":["Muhammad Ali Jinnah University, Islamabad","Muhammad Ali Jinnah University, Islamabad, Pakistan"],"affiliations":[{"raw_affiliation_string":"Muhammad Ali Jinnah University, Islamabad","institution_ids":["https://openalex.org/I23805111"]},{"raw_affiliation_string":"Muhammad Ali Jinnah University, Islamabad, Pakistan","institution_ids":["https://openalex.org/I23805111"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101730630"],"corresponding_institution_ids":["https://openalex.org/I5400463"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06778666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"241","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9997000098228455,"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.9997000098228455,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9714000225067139,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7491540312767029},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6315980553627014},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5670524835586548},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5296772718429565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5282180309295654},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49606046080589294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4443012773990631},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4414164423942566},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4230087399482727},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.41500210762023926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31673261523246765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20553156733512878},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1902790069580078},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15739169716835022},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.1534179151058197}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7491540312767029},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6315980553627014},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5670524835586548},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5296772718429565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5282180309295654},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49606046080589294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4443012773990631},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4414164423942566},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4230087399482727},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.41500210762023926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31673261523246765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20553156733512878},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1902790069580078},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15739169716835022},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.1534179151058197},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icdim.2013.6693966","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2013.6693966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Digital Information Management (ICDIM 2013)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.710.1519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.710.1519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ming.org.pk/zahid_papers/GP%20MST.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1576660662","https://openalex.org/W1879012921","https://openalex.org/W1965850153","https://openalex.org/W2031148068","https://openalex.org/W2043113141","https://openalex.org/W2079213405","https://openalex.org/W2082629204","https://openalex.org/W2136231974","https://openalex.org/W2138987445","https://openalex.org/W2147411825","https://openalex.org/W2154929945","https://openalex.org/W2157421865","https://openalex.org/W2162974503","https://openalex.org/W6681878147","https://openalex.org/W6683679523"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"The":[0,64],"problem":[1],"of":[2,12,23,66],"extracting":[3],"a":[4,13,17,32,52,72],"degree":[5,22,59,104],"constraint":[6,60,105],"spanning":[7,14,61,106],"tree":[8,15,62,73,107],"deals":[9],"with":[10],"extraction":[11,108],"from":[16],"given":[18],"graph.":[19],"Where,":[20],"the":[21,58,67,79],"each":[24],"node":[25],"is":[26,38,76],"greater":[27],"than":[28],"or":[29],"equal":[30],"to":[31,57,85,100],"thread":[33],"hold":[34],"value.":[35],"Genetic":[36],"Programming":[37],"an":[39],"evolution":[40],"based":[41,55],"strategy":[42],"appropriate":[43],"for":[44,83,103],"optimization":[45],"problems.":[46],"In":[47],"this":[48],"paper":[49],"we":[50],"propose":[51],"genetic":[53,81],"programming":[54],"solution":[56,93],"extraction.":[63],"individuals":[65],"population":[68],"are":[69],"represented":[70],"as":[71,78],"and":[74,97],"mutation":[75],"applied":[77],"only":[80],"operator":[82],"evaluation":[84],"occur.":[86],"We":[87],"have":[88],"further":[89],"tested":[90],"our":[91],"proposed":[92],"on":[94],"different":[95],"graph":[96],"found":[98],"it":[99],"be":[101],"suitable":[102],"problem.":[109]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}