{"id":"https://openalex.org/W1994924587","doi":"https://doi.org/10.1137/s0097539702403098","title":"Reachability and Distance Queries via 2-Hop Labels","display_name":"Reachability and Distance Queries via 2-Hop Labels","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1994924587","doi":"https://doi.org/10.1137/s0097539702403098","mag":"1994924587"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702403098","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702403098","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":["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/A5026385549","display_name":"Edith Cohen","orcid":"https://orcid.org/0000-0002-3926-8237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Edith Cohen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050273239","display_name":"Eran Halperin","orcid":"https://orcid.org/0000-0002-2373-3691"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eran Halperin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uri Zwick","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":5.0884,"has_fulltext":false,"cited_by_count":510,"citation_normalized_percentile":{"value":0.95548625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"32","issue":"5","first_page":"1338","last_page":"1355"},"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.9994000196456909,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/reachability","display_name":"Reachability","score":0.7284343242645264},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6110474467277527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6067653894424438},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5084518194198608},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.47063112258911133},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.46691325306892395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43171826004981995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42375028133392334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3728073239326477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35186851024627686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33166491985321045}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7284343242645264},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6110474467277527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6067653894424438},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5084518194198608},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.47063112258911133},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.46691325306892395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43171826004981995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42375028133392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3728073239326477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35186851024627686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33166491985321045},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539702403098","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702403098","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:CiteSeerX.psu:10.1.1.10.1278","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/%7Ezwick/papers/2hop-SODA.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.6998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~haimk/papers/labels-full.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.2127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.2127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~eran/publications/papers/labels.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2013469283","https://openalex.org/W2027428596","https://openalex.org/W2040924621","https://openalex.org/W2057046770","https://openalex.org/W2090359754","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W4232548171"],"related_works":["https://openalex.org/W2963892764","https://openalex.org/W2798731600","https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W4388031360","https://openalex.org/W94062305","https://openalex.org/W4287775348","https://openalex.org/W2237480599"],"abstract_inverted_index":{"Reachability":[0],"and":[1,26,71,82,122,164,193,200,236],"distance":[2],"queries":[3],"in":[4,42,50,99],"graphs":[5,25],"are":[6,86],"fundamental":[7],"to":[8,16,61,131,168,179],"numerous":[9],"applications,":[10],"ranging":[11],"from":[12,129,140,213],"geographic":[13],"navigation":[14],"systems":[15],"Internet":[17],"routing.":[18],"Some":[19],"of":[20,80,91,96,112,137,154,158,191,204,224,245,249],"these":[21],"applications":[22],"involve":[23],"huge":[24],"yet":[27],"require":[28],"fast":[29],"query":[30,67],"answering.":[31],"We":[32,142,182,196],"propose":[33],"a":[34,43,66,100,106,109,126,135,155,189],"new":[35],"data":[36,46,186,207],"structure":[37,47,187,208],"for":[38,117,147],"representing":[39],"all":[40,97],"distances":[41],"graph.":[44,101],"The":[45],"is":[48,108,125,134,162,227,237],"distributed":[49],"the":[51,62,78,92,184,202,205,221,225,233,246,250],"sense":[52],"that":[53,65,133,220],"it":[54],"may":[55,73],"be":[56,74,166],"viewed":[57],"as":[58],"assigning":[59],"labels":[60,79,85,226],"vertices,":[63],"such":[64,105,115],"involving":[68],"vertices":[69,120],"u":[70,81,121,130],"v":[72,132],"answered":[75],"using":[76,188],"only":[77],"v.":[83],"Our":[84,160,217],"based":[87],"on":[88,209],"2-hop":[89,152],"covers":[90],"shortest":[93,103,113,127,176],"paths,":[94,98,104,177],"or":[95,170,174,178],"For":[102],"cover":[107,153],"collection":[110,157],"S":[111],"paths":[114,139],"that,":[116],"every":[118],"two":[119,138],"v,":[123],"there":[124],"path":[128],"concatenation":[136],"S.":[141],"describe":[143],"an":[144,149,242],"efficient":[145],"algorithm":[146,199],"finding":[148],"almost":[150],"optimal":[151],"given":[156],"paths.":[159],"approach":[161],"general":[163],"can":[165],"applied":[167],"directed":[169],"undirected":[171],"graphs,":[172],"exact":[173],"approximate":[175],"reachability":[180],"queries.":[181],"study":[183],"proposed":[185],"combination":[190],"theoretical":[192],"experimental":[194],"means.":[195],"implemented":[197],"our":[198],"checked":[201],"size":[203,223],"resulting":[206],"several":[210],"real-life":[211],"networks":[212],"different":[214],"application":[215],"areas.":[216],"experiments":[218],"show":[219],"total":[222],"typically":[228],"not":[229],"much":[230],"larger":[231],"than":[232,241],"network":[234],"itself,":[235],"usually":[238],"considerably":[239],"smaller":[240],"explicit":[243],"representation":[244],"transitive":[247],"closure":[248],"network.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":34},{"year":2024,"cited_by_count":32},{"year":2023,"cited_by_count":33},{"year":2022,"cited_by_count":29},{"year":2021,"cited_by_count":34},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":30},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":27},{"year":2016,"cited_by_count":26},{"year":2015,"cited_by_count":38},{"year":2014,"cited_by_count":25},{"year":2013,"cited_by_count":38},{"year":2012,"cited_by_count":19}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}