{"id":"https://openalex.org/W2138358032","doi":"https://doi.org/10.1007/978-3-642-03816-7_25","title":"How to Use Spanning Trees to Navigate in Graphs","display_name":"How to Use Spanning Trees to Navigate in Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2138358032","doi":"https://doi.org/10.1007/978-3-642-03816-7_25","mag":"2138358032"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03816-7_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5086851146","display_name":"Feodor F. Dragan","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Algorithmic Research Laboratory Department of Computer Science, Kent State University, Kent, OH, 44242, USA"],"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100666554","display_name":"Yang Xiang","orcid":"https://orcid.org/0000-0001-5252-0831"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Xiang","raw_affiliation_strings":["Algorithmic Research Laboratory Department of Computer Science, Kent State University, Kent, OH, 44242, USA"],"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086851146"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6576,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72993604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"282","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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.9965999722480774,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9957000017166138,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7315956354141235},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6960652470588684},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6578061580657959},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6283702254295349},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5433221459388733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4739121198654175},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4570496380329132},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44094526767730713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4351416528224945},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.41974157094955444},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4166001081466675},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4112076163291931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40517082810401917},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3983698785305023},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.39502525329589844},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12907525897026062}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7315956354141235},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6960652470588684},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6578061580657959},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6283702254295349},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5433221459388733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4739121198654175},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4570496380329132},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44094526767730713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4351416528224945},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.41974157094955444},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4166001081466675},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4112076163291931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40517082810401917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3983698785305023},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.39502525329589844},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12907525897026062},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-03816-7_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W28957298","https://openalex.org/W1500591628","https://openalex.org/W1502087588","https://openalex.org/W1527463082","https://openalex.org/W1558472664","https://openalex.org/W1565447544","https://openalex.org/W1566333620","https://openalex.org/W1568313715","https://openalex.org/W1568961751","https://openalex.org/W1579049696","https://openalex.org/W1907032667","https://openalex.org/W1965650021","https://openalex.org/W1975595616","https://openalex.org/W1983598160","https://openalex.org/W1994320209","https://openalex.org/W2007575140","https://openalex.org/W2013215731","https://openalex.org/W2029448190","https://openalex.org/W2030306674","https://openalex.org/W2030982625","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2044959725","https://openalex.org/W2045430818","https://openalex.org/W2057994027","https://openalex.org/W2062210818","https://openalex.org/W2082613046","https://openalex.org/W2085463780","https://openalex.org/W2086119402","https://openalex.org/W2101963262","https://openalex.org/W2109370679","https://openalex.org/W2120851678","https://openalex.org/W2126464568","https://openalex.org/W2128678576","https://openalex.org/W2128744826","https://openalex.org/W2134086356","https://openalex.org/W2135166946","https://openalex.org/W2138358032","https://openalex.org/W2139484566","https://openalex.org/W2141663929","https://openalex.org/W2142420687","https://openalex.org/W2143474538","https://openalex.org/W2151358465","https://openalex.org/W2152809170","https://openalex.org/W2152948207","https://openalex.org/W2158663853","https://openalex.org/W2162450625","https://openalex.org/W2176446742","https://openalex.org/W2406186867","https://openalex.org/W2630202923","https://openalex.org/W4205300528","https://openalex.org/W4230136419","https://openalex.org/W4232548171","https://openalex.org/W4235484205","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2307044859","https://openalex.org/W2911818503","https://openalex.org/W2014991506","https://openalex.org/W2041764189","https://openalex.org/W4231397933","https://openalex.org/W168125756","https://openalex.org/W4380840098","https://openalex.org/W2621339359"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}