{"id":"https://openalex.org/W7163868032","doi":"https://doi.org/10.4230/lipics.swat.2026.35","title":"Path-Reporting Distance Oracles for Vertex-Labeled Graphs","display_name":"Path-Reporting Distance Oracles for Vertex-Labeled Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163868032","doi":"https://doi.org/10.4230/lipics.swat.2026.35"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26071","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.35","pdf_url":null,"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.35","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Neiman, Ofer","raw_affiliation_strings":["Faculty of Computer and Information Science, Ben-Gurion University of the Negev"],"raw_orcid":"https://orcid.org/0000-0003-4179-4364","affiliations":[{"raw_affiliation_string":"Faculty of Computer and Information Science, Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138179112","display_name":"Alon Spector","orcid":"https://orcid.org/0009-0005-1328-1985"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Spector, Alon","raw_affiliation_strings":["Faculty of Computer and Information Science, Ben-Gurion University of the Negev"],"raw_orcid":"https://orcid.org/0009-0005-1328-1985","affiliations":[{"raw_affiliation_string":"Faculty of Computer and Information Science, Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]}],"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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94080648,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.34860000014305115,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.34860000014305115,"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/T11106","display_name":"Data Management and Algorithms","score":0.22030000388622284,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.1662999987602234,"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/oracle","display_name":"Oracle","score":0.8726000189781189},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6455000042915344},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49480000138282776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4747999906539917},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3840999901294708},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.3156000077724457},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.3125}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8726000189781189},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6899999976158142},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6455000042915344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5748000144958496},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49480000138282776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36910000443458557},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.3125},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2955000102519989},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26170000433921814},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2605000138282776}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26071","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.35","pdf_url":null,"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":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.35","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.35","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26071","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.35","pdf_url":null,"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"G":[1,66],"=":[2],"(V,E)":[3],"be":[4],"a":[5,16,63,86,89,150,177,209,218,270],"weighted":[6],"undirected":[7],"graph,":[8],"with":[9,25,47,154,274],"n":[10],"vertices.":[11],"A":[12,29,95],"distance":[13,23,97,119,152,212,272],"oracle":[14,46,59,98,153,234,273],"is":[15,84,175,190],"data":[17],"structure":[18],"that":[19,141],"can":[20,60],"quickly":[21],"answer":[22],"queries,":[24],"some":[26],"stretch":[27,48,155,174,222,236,253,275],"factor.":[28],"seminal":[30],"work":[31],"of":[32,92,101,126,179,217,261],"[Thorup":[33,184],"and":[34,53,109,160,185,188,200,223,241,281],"Zwick,":[35,186],"2005],":[36,187],"given":[37,85],"an":[38,45],"integer":[39,144],"k":[40,145],"\u2265":[41],"1,":[42,147,232],"provides":[43],"such":[44],"2k-1,":[49,257,276],"query":[50,157,238,265,277],"time":[51,158,239,278],"O(k),":[52,159,240],"size":[54,93,161,242,282],"O(k\u22c5":[55,162,283],"n^{1+1/k}).":[56],"Furthermore,":[57],"this":[58,73,198],"also":[61],"report":[62],"path":[64],"in":[65,80,138,183,197,221],"corresponding":[67],"to":[68,122,250,254],"the":[69,102,118,123,202,215,252,255,259,264],"returned":[70],"distance.":[71],"In":[72],"paper":[74],"we":[75,207,247,268],"focus":[76],"on":[77],"vertex-labeled":[78],"graphs,":[79],"which":[81],"each":[82],"vertex":[83,125],"label":[87,127],"from":[88,120,169],"set":[90],"L":[91],"\ud835\udcc1.":[94],"vertex-label":[96,151,211,271],"answers":[99],"queries":[100],"form":[103],"(v,\u03bb),":[104],"where":[105],"v":[106,121],"\u2208":[107,111],"V":[108],"\u03bb":[110],"L,":[112],"by":[113],"reporting":[114],"(an":[115],"approximation":[116],"to)":[117],"closest":[124],"\u03bb.":[128],"Following":[129],"[Danny":[130],"Hermelin":[131],"et":[132],"al.,":[133],"2011],":[134],"it":[135,189],"was":[136],"shown":[137],"[Chechik,":[139],"2012]":[140],"for":[142],"any":[143,226],">":[146],"there":[148],"exists":[149],"4k-5,":[156],"n\u22c5":[163,284],"\ud835\udcc1^{1/k}).":[164,244,285],"This":[165],"state-of-the-art":[166],"result":[167],"suffers":[168],"two":[170],"main":[171],"drawbacks:":[172],"The":[173],"roughly":[176],"factor":[178],"2":[180],"larger":[181],"than":[182],"not":[191],"path-reporting.":[192],"We":[193],"address":[194],"these":[195],"concerns":[196],"work,":[199],"provide":[201],"following":[203],"results.":[204],"-":[205,245],"First,":[206],"devise":[208,269],"path-reporting":[210],"oracle,":[213],"at":[214,258],"cost":[216,260],"slight":[219],"increase":[220],"size.":[224],"For":[225],"constant":[227],"0":[228],"<":[229,231],"\u03b5":[230],"our":[233],"has":[235],"(4k-5)\u22c5(1+\u03b5),":[237],"O(n^{1+o(1)}\u22c5":[243],"Second,":[246],"show":[248],"how":[249],"improve":[251],"optimal":[256],"mildly":[262],"increasing":[263],"time.":[266],"Specifically,":[267],"O(\ud835\udcc1^{1/k}\u22c5log":[279],"n),":[280]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}