{"id":"https://openalex.org/W2272341256","doi":"https://doi.org/10.5220/0004883704640471","title":"An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion","display_name":"An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2272341256","doi":"https://doi.org/10.5220/0004883704640471","mag":"2272341256"},"language":"en","primary_location":{"id":"doi:10.5220/0004883704640471","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004883704640471","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0004883704640471","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024741114","display_name":"Rodrigo Lankaites Pinheiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rodrigo Lankaites Pinheiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071233329","display_name":"Ademir Aparecido Constantino","orcid":"https://orcid.org/0000-0002-9617-5256"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ademir Aparecido Constantino","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063827358","display_name":"Candido Ferreira Xavier de Mendon\u00e7a","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Candido F. X. de Mendon\u00e7a","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037965570","display_name":"Dario Landa-Silva","orcid":"https://orcid.org/0000-0002-9499-6827"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dario Landa-Silva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"464","last_page":"471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/combinatorics","display_name":"Combinatorics","score":0.6616054177284241},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5702976584434509},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5235604643821716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49242982268333435},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.46936705708503723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45978856086730957},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.448416143655777},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42608439922332764},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4096612334251404},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40577614307403564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39090582728385925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.350739061832428},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20620059967041016}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6616054177284241},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5702976584434509},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5235604643821716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49242982268333435},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.46936705708503723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45978856086730957},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.448416143655777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42608439922332764},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4096612334251404},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40577614307403564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39090582728385925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.350739061832428},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20620059967041016},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.5220/0004883704640471","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004883704640471","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.7922","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.7922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/%7Epszjds/research/files/dls_iceis2014.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.nottingham.ac.uk:31330","is_oa":true,"landing_page_url":"http://eprints.nottingham.ac.uk/31330/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402014","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:nottingham-repository.worktribe.com:999568","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/999568","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"doi:10.5220/0004883704640471","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004883704640471","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1536302196","https://openalex.org/W1574303240","https://openalex.org/W1639032689","https://openalex.org/W1875640138","https://openalex.org/W1908738628","https://openalex.org/W2005079828","https://openalex.org/W2021903733","https://openalex.org/W2024491681","https://openalex.org/W2045027193","https://openalex.org/W2047088053","https://openalex.org/W2056154411","https://openalex.org/W2060538865","https://openalex.org/W2091252880","https://openalex.org/W2125826425","https://openalex.org/W2136157422","https://openalex.org/W2340365916","https://openalex.org/W2586392344","https://openalex.org/W2928260992","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W4294946095","https://openalex.org/W2383344953","https://openalex.org/W4300822625","https://openalex.org/W2316246740","https://openalex.org/W2611288326","https://openalex.org/W4298388358","https://openalex.org/W1995383828","https://openalex.org/W2061182715","https://openalex.org/W2982283786","https://openalex.org/W1970462054"],"abstract_inverted_index":{"A":[0],"non-planar":[1,26],"graph":[2,27,56,99],"can":[3],"only":[4],"be":[5],"planarised":[6],"if":[7],"it":[8,140],"is":[9,60,70,92,141,157],"structurally":[10],"modified.":[11],"This":[12,123],"work":[13,108],"presents":[14],"a":[15,25,32,41,55,115,121],"new":[16],"heuristic":[17,117,125],"algorithm":[18,37,97,112,118,155],"that":[19,68,87,113],"uses":[20,114],"vertices":[21,45,83,102],"deletion":[22,52,103,152],"to":[23,30,39,46,119],"modify":[24],"in":[28],"order":[29],"obtain":[31],"planar":[33,73],"subgraph.":[34],"The":[35,50,154],"proposed":[36],"aims":[38],"delete":[40],"minimum":[42],"number":[43,53],"of":[44,54,75,81,84,129,161],"achieve":[47],"its":[48],"goal.":[49],"vertex":[51,151],"G":[57,76],"=":[58,133,137],"(V,E)":[59],"the":[61,79,88,144,150],"smallest":[62],"integer":[63],"k":[64,82],"?":[65],"0":[66],"such":[67],"there":[69],"an":[71,95,110],"induced":[72],"subgraph":[74],"obtained":[77],"by":[78,101,159],"removal":[80],"G.":[85],"Considering":[86],"corresponding":[89],"decision":[90],"problem":[91],"NPcomplete":[93],"and":[94,135,139,148],"approximation":[96],"for":[98],"planarisation":[100],"does":[104],"not":[105],"exist,":[106],"this":[107],"proposes":[109],"evolutionary":[111],"constructive":[116,124],"planarise":[120],"graph.":[122],"has":[126],"time":[127],"complexity":[128],"O(n+m),":[130],"where":[131],"m":[132],"|V|":[134],"n":[136],"|E|,":[138],"based":[142],"on":[143,149],"PQ-trees":[145],"data":[146],"structure":[147],"operation.":[153],"performance":[156],"verified":[158],"means":[160],"case":[162],"studies.":[163]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}