{"id":"https://openalex.org/W1524692559","doi":"https://doi.org/10.1007/3-540-45841-7_20","title":"Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles","display_name":"Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1524692559","doi":"https://doi.org/10.1007/3-540-45841-7_20","mag":"1524692559"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45841-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_20","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":"conference-paper","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/A5072214666","display_name":"Stefan Langerman","orcid":"https://orcid.org/0000-0001-6999-3088"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stefan Langerman","raw_affiliation_strings":["School of Computer Science, McGill University, 3480 University St., Suite 318, H3A 2A7, Montr\u00e9al, Qu\u00e9bec, CANADA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, 3480 University St., Suite 318, H3A 2A7, Montr\u00e9al, Qu\u00e9bec, CANADA","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045902784","display_name":"Pat Morin","orcid":"https://orcid.org/0000-0003-0471-4118"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pat Morin","raw_affiliation_strings":["School of Computer Science, McGill University, 3480 University St., Suite 318, H3A 2A7, Montr\u00e9al, Qu\u00e9bec, CANADA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, 3480 University St., Suite 318, H3A 2A7, Montr\u00e9al, Qu\u00e9bec, CANADA","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112239284","display_name":"Michael Soss","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Soss","raw_affiliation_strings":["Chemical Computing Group, Inc., 1010 Sherbrooke Street West, Suite 910, H3A 2R7, Montr\u00e9al, Qu\u00e9bec, CANADA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chemical Computing Group, Inc., 1010 Sherbrooke Street West, Suite 910, H3A 2R7, Montr\u00e9al, Qu\u00e9bec, CANADA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"261"},"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.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9835000038146973,"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/spanning-tree","display_name":"Spanning tree","score":0.8622039556503296},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7569789886474609},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6360390186309814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5757396817207336},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5721752047538757},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5567754507064819},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5456006526947021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5379337668418884},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5015075206756592},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.43927186727523804},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4309697151184082},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.42945927381515503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35218286514282227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3519757390022278},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.33935388922691345},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07566344738006592}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8622039556503296},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7569789886474609},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6360390186309814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5757396817207336},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5721752047538757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5567754507064819},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5456006526947021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5379337668418884},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5015075206756592},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.43927186727523804},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4309697151184082},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.42945927381515503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35218286514282227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3519757390022278},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.33935388922691345},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07566344738006592},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45841-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_20","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.8513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cg.scs.carleton.ca/~morin/publications/spanner/detour-stacs.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1499162805","https://openalex.org/W1552092932","https://openalex.org/W1968301997","https://openalex.org/W1979503961","https://openalex.org/W1986084080","https://openalex.org/W2060978628","https://openalex.org/W2070164574","https://openalex.org/W2076014803","https://openalex.org/W2119251691","https://openalex.org/W2180374207","https://openalex.org/W2978212472"],"related_works":["https://openalex.org/W3081212354","https://openalex.org/W2943635264","https://openalex.org/W1561849181","https://openalex.org/W1587959445","https://openalex.org/W1964611452","https://openalex.org/W1985149601","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W4380840098","https://openalex.org/W2082872574"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}