{"id":"https://openalex.org/W2068912469","doi":"https://doi.org/10.1137/s0097539702411381","title":"Orderly Spanning Trees with Applications","display_name":"Orderly Spanning Trees with Applications","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2068912469","doi":"https://doi.org/10.1137/s0097539702411381","mag":"2068912469"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702411381","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702411381","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0102006","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yi-Ting Chiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi-Ting Chiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ching-Chi Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ching-Chi Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hsueh-I Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hsueh-I Lu","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.6293,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.90206092,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"34","issue":"4","first_page":"924","last_page":"945"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9513000249862671,"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.9513000249862671,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.011800000444054604,"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/T10799","display_name":"Data Visualization and Analytics","score":0.007300000172108412,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8704000115394592},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.8123999834060669},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.7361999750137329},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.597000002861023},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.5006999969482422},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5001000165939331},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.48330000042915344},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4715999960899353},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.45399999618530273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4474000036716461}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8704000115394592},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.8123999834060669},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.7361999750137329},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.597000002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5728999972343445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5314000248908997},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.5006999969482422},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5001000165939331},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.48330000042915344},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4715999960899353},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4474000036716461},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4189000129699707},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.41100001335144043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3824999928474426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3720000088214874},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.3449999988079071},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31049999594688416},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.31040000915527344},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.3086000084877014},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.30320000648498535},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.2858999967575073},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26759999990463257},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2590000033378601},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25270000100135803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25110000371932983},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539702411381","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702411381","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0102006","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0102006","pdf_url":"https://arxiv.org/pdf/cs/0102006","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0102006","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0102006","pdf_url":"https://arxiv.org/pdf/cs/0102006","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1964716955","https://openalex.org/W1965372753","https://openalex.org/W1975373301","https://openalex.org/W1983943307","https://openalex.org/W1984308317","https://openalex.org/W1987374783","https://openalex.org/W1997262402","https://openalex.org/W2000514873","https://openalex.org/W2003525146","https://openalex.org/W2010356699","https://openalex.org/W2021355739","https://openalex.org/W2038318850","https://openalex.org/W2047619746","https://openalex.org/W2052977033","https://openalex.org/W2065471429","https://openalex.org/W2065527713","https://openalex.org/W2083176195","https://openalex.org/W2089026470","https://openalex.org/W2093788424","https://openalex.org/W2104525387","https://openalex.org/W2119115989","https://openalex.org/W2123300935","https://openalex.org/W2128777897","https://openalex.org/W2142636632","https://openalex.org/W2164485560","https://openalex.org/W2325654786","https://openalex.org/W4205163994","https://openalex.org/W4319782100"],"related_works":["https://openalex.org/W2487945693","https://openalex.org/W2066857130","https://openalex.org/W4286893801","https://openalex.org/W2095369952","https://openalex.org/W3158489125","https://openalex.org/W2032442730","https://openalex.org/W1969602516","https://openalex.org/W2979533220","https://openalex.org/W2030579180","https://openalex.org/W3208173532"],"abstract_inverted_index":{"We":[0,65],"introduce":[1],"and":[2,58,97],"study":[3],"orderly":[4,30,40,60,71],"spanning":[5,31,61,72],"trees":[6],"of":[7,49,63,70,93,104],"plane":[8,21,26],"graphs.":[9,22],"This":[10],"algorithmic":[11],"tool":[12],"generalizes":[13],"canonical":[14],"orderings,":[15],"which":[16],"exist":[17],"only":[18],"for":[19,42,79,87],"triconnected":[20],"Although":[23],"not":[24],"every":[25],"graph":[27,46,53,107],"admits":[28],"an":[29,35,39,50,59,89],"tree,":[32],"we":[33],"provide":[34],"algorithm":[36,86],"to":[37,56],"compute":[38],"pair":[41],"any":[43],"connected":[44],"planar":[45,52,95,106],"G,":[47,57],"consisting":[48],"embedded":[51],"H":[54],"isomorphic":[55],"tree":[62],"H.":[64],"also":[66],"present":[67],"several":[68],"applications":[69],"trees:":[73],"(1)":[74],"a":[75,94,105],"new":[76],"constructive":[77],"proof":[78],"Schnyder's":[80],"realizer":[81],"theorem,":[82],"(2)":[83],"the":[84,99],"first":[85],"computing":[88],"area-optimal":[90],"2-visibility":[91],"drawing":[92],"graph,":[96],"(3)":[98],"most":[100],"compact":[101],"known":[102],"encoding":[103],"with":[108],"O(1)-time":[109],"query":[110],"support.":[111],"All":[112],"algorithms":[113],"in":[114,118],"this":[115],"paper":[116],"run":[117],"linear":[119],"time.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"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":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}