{"id":"https://openalex.org/W2089449364","doi":"https://doi.org/10.7155/jgaa.00045","title":"Level Planar Embedding in Linear Time","display_name":"Level Planar Embedding in Linear Time","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2089449364","doi":"https://doi.org/10.7155/jgaa.00045","mag":"2089449364"},"language":"en","primary_location":{"id":"doi:10.7155/jgaa.00045","doi":"https://doi.org/10.7155/jgaa.00045","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00045","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,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00045","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110594951","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-6480-2614","observed_orcids":["https://orcid.org/0000-0002-6480-2614"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055932964","display_name":"Sebastian Leipert","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sebastian Leipert","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":2.1702,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.8739726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":"6","issue":"1","first_page":"67","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5541999936103821,"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.5541999936103821,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.27469998598098755,"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.03550000116229057,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.8240000009536743},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.6380000114440918},{"id":"https://openalex.org/keywords/planar-graph-drawing","display_name":"planar graph drawing","score":0.7300000190734863}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7135714292526245},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6483924388885498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5425655245780945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5143207311630249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4027150571346283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28814035654067993},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.16663962602615356},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16050809621810913}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7155/jgaa.00045","doi":"https://doi.org/10.7155/jgaa.00045","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00045","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,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b1beb62bf9284e30ba688425052f647b","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/b1beb62bf9284e30ba688425052f647b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Graph Algorithms and Applications, Vol 6, Iss 1 (2002)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.00045","doi":"https://doi.org/10.7155/jgaa.00045","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00045","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,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7039139306","https://openalex.org/W7020309389","https://openalex.org/W7039162073","https://openalex.org/W1852912860","https://openalex.org/W1514707287","https://openalex.org/W1514063713","https://openalex.org/W2154845271","https://openalex.org/W7011430172","https://openalex.org/W7100020431","https://openalex.org/W2027881104"],"abstract_inverted_index":{"In":[0,107],"a":[1,111,118,166],"level":[2,47,66,112,119,124,158,167],"directed":[3],"acyclic":[4],"graph":[5,114,125],"G":[6,55],"=":[7,78],"(V;E)":[8],"the":[9,60,75,87,95,123,139],"vertex":[10],"set":[11],"V":[12],"is":[13,51,163],"partitioned":[14],"into":[15],"k":[16,80],"\u2264":[17,145,147],"|V":[18],"|":[19,83],"levels":[20],"V1;":[21],"V2...":[22],"Vk":[23],"such":[24,62],"that":[25,63],"for":[26,64,156],"each":[27,65,142],"edge":[28,116],"(u,":[29],"v)":[30],"\u2208":[31,35,70,85],"E":[32],"with":[33,92],"u":[34],"Vi":[36,71,143],"and":[37,98,173],"v":[38,69],"\u2208;":[39],"Vj":[40],"we":[41],"have":[42],"i":[43,146],"<":[44],"j.":[45],"The":[46],"planarity":[48,168],"testing":[49],"problem":[50],"to":[52,94,109,127],"decide":[53],"if":[54],"can":[56],"be":[57,128],"drawn":[58,73,90],"in":[59,141],"plane":[61],"Vi,":[67],"all":[68],"are":[72,89,133],"on":[74,165],"line":[76],"li":[77],"{(x,":[79],"-":[81],"i)":[82],"x":[84],"\u211d},":[86],"edges":[88,100],"monotonically":[91],"respect":[93],"vertical":[96],"direction,":[97],"no":[99],"intersect":[101],"except":[102],"at":[103],"their":[104],"end":[105],"vertices.":[106],"order":[108],"draw":[110],"planar":[113,120,131,159],"without":[115],"crossings,":[117],"embedding":[121,157],"of":[122,138],"has":[126],"computed.":[129],"Level":[130],"embeddings":[132],"characterized":[134],"by":[135,170],"linear":[136],"orderings":[137],"vertices":[140],"(1":[144],"k).":[148],"We":[149],"present":[150],"an":[151],"O(|V":[152],"|)":[153],"time":[154],"algorithm":[155],"graphs.":[160],"This":[161],"approach":[162],"based":[164],"test":[169],"Junger,":[171],"Leipert,":[172],"Mutzel":[174],"[6].":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}
