{"id":"https://openalex.org/W7162524793","doi":"https://doi.org/10.4230/lipics.socg.2026.20","title":"The Spanning Ratio of the Directed \u0398\u2086-Graph Is 5","display_name":"The Spanning Ratio of the Directed \u0398\u2086-Graph Is 5","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162524793","doi":"https://doi.org/10.4230/lipics.socg.2026.20"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25826","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.20/LIPIcs.SoCG.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.20/LIPIcs.SoCG.2026.20.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137171323","display_name":"Prosenjit Bose","orcid":"https://orcid.org/0000-0002-8906-0573"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bose, Prosenjit","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Canada"],"raw_orcid":"https://orcid.org/0000-0002-8906-0573","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042440491","display_name":"Jean-Lou De Carufel","orcid":"https://orcid.org/0000-0002-6734-8234"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"De Carufel, Jean-Lou","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Ottawa, Canada"],"raw_orcid":"https://orcid.org/0000-0002-6734-8234","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128777709","display_name":"John Stuart","orcid":null},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stuart, John","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Ottawa, Canada"],"raw_orcid":"https://orcid.org/0009-0005-3844-9000","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137167586","display_name":"Darryl Hill","orcid":"https://orcid.org/0000-0002-5210-7112"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hill, Darryl","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Canada"],"raw_orcid":"https://orcid.org/0000-0002-5210-7112","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62693267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9865999817848206,"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.9865999817848206,"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.0024999999441206455,"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.0017000000225380063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6352999806404114},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.519599974155426},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43939998745918274},{"id":"https://openalex.org/keywords/equilateral-triangle","display_name":"Equilateral triangle","score":0.4390000104904175},{"id":"https://openalex.org/keywords/equiangular-polygon","display_name":"Equiangular polygon","score":0.4260999858379364},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.3912999927997589},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.3695000112056732},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.3450999855995178}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8234000205993652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.816100001335144},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6352999806404114},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.519599974155426},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43939998745918274},{"id":"https://openalex.org/C146786541","wikidata":"https://www.wikidata.org/wiki/Q157002","display_name":"Equilateral triangle","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C41779539","wikidata":"https://www.wikidata.org/wiki/Q2543717","display_name":"Equiangular polygon","level":3,"score":0.4260999858379364},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37450000643730164},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C169611556","wikidata":"https://www.wikidata.org/wiki/Q230689","display_name":"Contractible space","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C97787015","wikidata":"https://www.wikidata.org/wiki/Q10615255","display_name":"Incircle and excircles of a triangle","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.26460000872612}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25826","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.20/LIPIcs.SoCG.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.20","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25826","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.20/LIPIcs.SoCG.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162524793.pdf","grobid_xml":"https://content.openalex.org/works/W7162524793.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,14,100,150,174,181,209],"finite":[2],"set":[3],"P":[4,40],"\u2282":[5],"\u211d\u00b2,":[6],"the":[7,24,33,58,63,66,71,82,93,104,113,121,125,133,158,164,192],"directed":[8],"Theta-6":[9],"graph,":[10],"denoted":[11],"\u0398\u2086(P),":[12],"is":[13,29,41,55,68,86,92,127,157],"well-studied":[15],"geometric":[16],"graph":[17],"due":[18],"to":[19,57,78,112,180,191,200],"its":[20],"close":[21,145],"relationship":[22],"with":[23,47],"Delaunay":[25],"triangulation.":[26],"The":[27],"\u0398\u2086(P)-graph":[28,72,126],"defined":[30],"as":[31],"follows:":[32],"plane":[34],"around":[35],"each":[36,52],"point":[37,59],"u":[38,54,77,98],"\u2208":[39],"partitioned":[42],"into":[43],"6":[44],"equiangular":[45],"cones":[46],"apex":[48],"u,":[49],"and":[50,107,130,138],"in":[51,132],"cone,":[53],"joined":[56],"whose":[60,108],"projection":[61],"on":[62,99,103],"bisector":[64],"of":[65,84,124,154,167,194],"cone":[67,114],"closest.":[69],"Equivalently,":[70],"contains":[73],"an":[74],"edge":[75],"from":[76,88],"v":[79,102],"exactly":[80],"when":[81],"interior":[83],"\u2207_u^v":[85,91],"disjoint":[87],"P,":[89],"where":[90],"unique":[94],"equilateral":[95],"triangle":[96],"containing":[97],"corner,":[101],"opposite":[105],"side,":[106],"sides":[109],"are":[110],"parallel":[111],"boundaries.":[115],"It":[116],"was":[117],"previously":[118],"shown":[119],"that":[120,202],"spanning":[122,152,165],"ratio":[123,153,166],"between":[128],"4":[129],"7":[131],"worst":[134],"case":[135],"(Akitaya,":[136],"Biniaz,":[137],"Bose":[139],"Comput.":[140],"Geom.,":[141],"105-106:101881,":[142],"2022).":[143],"We":[144,196],"this":[146],"gap":[147],"by":[148,177],"showing":[149],"tight":[151,160],"5.":[155],"This":[156],"first":[159],"bound":[161,172,186],"proven":[162],"for":[163],"any":[168],"\u0398_k(P)-graph.":[169],"Our":[170,184],"lower":[171],"models":[173],"long":[175],"path":[176,210],"mapping":[178],"it":[179],"converging":[182],"series.":[183],"upper":[185],"proof":[187],"uses":[188],"techniques":[189],"novel":[190],"area":[193],"spanners.":[195],"use":[197],"linear":[198],"programming":[199],"prove":[201],"among":[203],"several":[204],"candidate":[205],"paths,":[206],"there":[207],"exists":[208],"satisfying":[211],"our":[212],"bound.":[213]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}