乐胖代购免代理版

{"id":"https://openalex.org/W2030421514","doi":"https://doi.org/10.7155/jgaa.00241","title":"Switch-Regular Upward Planarity Testing of Directed Trees","display_name":"Switch-Regular Upward Planarity Testing of Directed Trees","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2030421514","doi":"https://doi.org/10.7155/jgaa.00241","mag":"2030421514"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00241","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00241","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063119503","display_name":"Carla Binucci","orcid":"https://orcid.org/0000-0002-5320-9110"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Carla Binucci","raw_affiliation_strings":["University of Perugia"],"affiliations":[{"raw_affiliation_string":"University of Perugia","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029525801","display_name":"Emilio Di Giacomo","orcid":"https://orcid.org/0000-0002-9794-1928"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Emilio Di Giacomo","raw_affiliation_strings":["University of Perugia"],"affiliations":[{"raw_affiliation_string":"University of Perugia","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018323496","display_name":"Walter Didimo","orcid":"https://orcid.org/0000-0002-4379-6059"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Walter Didimo","raw_affiliation_strings":["University of Perugia"],"affiliations":[{"raw_affiliation_string":"University of Perugia","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062274442","display_name":"Aimal Rextin","orcid":"https://orcid.org/0000-0003-4206-9025"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aimal Rextin","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"USD","value_usd":0,"provenance":"doaj"},"apc_paid":null,"fwci":1.688,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.892566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":82,"max":83},"biblio":{"volume":"15","issue":"5","first_page":"587","last_page":"629"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.999,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.999,"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/T12288","display_name":"Optimization and Search Problems","score":0.9869,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.963,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.9115541},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42923427}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9115541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.50891185},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42923427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3273564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2996577}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00241","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00241","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1494545756","https://openalex.org/W1525468606","https://openalex.org/W1536942514","https://openalex.org/W1543709658","https://openalex.org/W1602383606","https://openalex.org/W1985050272","https://openalex.org/W1991787408","https://openalex.org/W2018091581","https://openalex.org/W2033866653","https://openalex.org/W2035308537","https://openalex.org/W2060157138","https://openalex.org/W2082102943","https://openalex.org/W2085607082","https://openalex.org/W2095981233","https://openalex.org/W2139241594"],"related_works":["https://openalex.org/W4297455769","https://openalex.org/W4288090301","https://openalex.org/W3003614666","https://openalex.org/W2982185603","https://openalex.org/W2963573247","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2164938550","https://openalex.org/W1816979946","https://openalex.org/W1598502370"],"abstract_inverted_index":{"Upward":[0],"planar":[1,27,65,80,105],"drawings":[2,8,81],"of":[3,19,97],"digraphs":[4],"are":[5],"crossing":[6],"free":[7],"where":[9],"all":[10],"edges":[11],"flow":[12],"in":[13,42,86],"the":[14,31,43,95],"upward":[15,26,32,52,64,79,104],"direction.":[16],"The":[17],"problem":[18],"deciding":[20,58],"whether":[21,59],"a":[22,50,60,73,102],"digraph":[23,61],"admits":[24,62],"an":[25,63,113],"drawing":[28,66,74,89],"is":[29,75],"called":[30,76],"planarity":[33,53],"testing":[34,54,116],"problem,":[35,55],"and":[36,117],"it":[37],"has":[38],"been":[39],"widely":[40],"studied":[41],"literature.":[44],"In":[45],"this":[46],"paper":[47],"we":[48,111],"investigate":[49],"new":[51],"that":[56,100],"is,":[57],"having":[67],"some":[68],"special":[69],"topological":[70],"properties:":[71],"such":[72],"switchregular.":[77],"Switch-regular":[78],"have":[82],"practical":[83],"algorithmic":[84],"impacts":[85],"several":[87],"graph":[88],"applications.":[90],"We":[91],"provide":[92],"characterizations":[93,110],"for":[94],"class":[96],"directed":[98],"trees":[99],"admit":[101],"switch-regular":[103],"drawing.":[106],"Based":[107],"on":[108],"these":[109],"describe":[112],"optimal":[114],"linear-time":[115],"embedding":[118],"algorithm.":[119]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2030421514","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-01-06T09:49:46.245574","created_date":"2016-06-24"}