{"id":"https://openalex.org/W2594084810","doi":"https://doi.org/10.1007/s00453-018-0501-y","title":"Binary Search in Graphs Revisited","display_name":"Binary Search in Graphs Revisited","publication_year":2018,"publication_date":"2018-08-22","ids":{"openalex":"https://openalex.org/W2594084810","doi":"https://doi.org/10.1007/s00453-018-0501-y","mag":"2594084810"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0501-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0501-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0501-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0501-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Argyrios Deligkas","raw_affiliation_strings":["Faculty of Industrial Engineering and Management, Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Faculty of Industrial Engineering and Management, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GB","GR"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK","Department of Computer Science, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"Department of Computer Science, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048361071"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.6412,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69509731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"81","issue":"5","first_page":"1757","last_page":"1780"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9995999932289124,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7230633497238159},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5940536856651306},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5715853571891785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5271317958831787},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5180771350860596},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4786221385002136},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4729989171028137},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46230995655059814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4232352375984192},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3887859582901001},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3542770743370056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35409992933273315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3327888250350952},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2349170446395874}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7230633497238159},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5940536856651306},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5715853571891785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5271317958831787},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5180771350860596},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4786221385002136},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4729989171028137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46230995655059814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4232352375984192},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3887859582901001},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3542770743370056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35409992933273315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3327888250350952},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2349170446395874},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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":3,"locations":[{"id":"doi:10.1007/s00453-018-0501-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0501-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0501-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:25934","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/25934/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Algorithmica, 2019, Vol.81(5), pp.1757 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1322744","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1322744","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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"}],"best_oa_location":{"id":"doi:10.1007/s00453-018-0501-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0501-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0501-y.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2119412745","display_name":null,"funder_award_id":"2021296","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3165237670","display_name":"Algorithms for Finding Approximate Nash Equilibria","funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4777440138","display_name":null,"funder_award_id":"L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5260088266","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P02002X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6811041424","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6979527396","display_name":null,"funder_award_id":"EP/P02002X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7315415636","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8639667597","display_name":null,"funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8719353587","display_name":null,"funder_award_id":"EP/P0","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G967227458","display_name":null,"funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2594084810.pdf","grobid_xml":"https://content.openalex.org/works/W2594084810.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1544735579","https://openalex.org/W1964136783","https://openalex.org/W1972094496","https://openalex.org/W1991217335","https://openalex.org/W1996384709","https://openalex.org/W2004158059","https://openalex.org/W2007918688","https://openalex.org/W2014544956","https://openalex.org/W2025583426","https://openalex.org/W2032004078","https://openalex.org/W2038435918","https://openalex.org/W2044712489","https://openalex.org/W2062785505","https://openalex.org/W2064883689","https://openalex.org/W2082764577","https://openalex.org/W2092864936","https://openalex.org/W2111790732","https://openalex.org/W2135496842","https://openalex.org/W2160645305","https://openalex.org/W2395495808","https://openalex.org/W2547960061","https://openalex.org/W2554148653","https://openalex.org/W2597289420","https://openalex.org/W2697349394","https://openalex.org/W2740884862","https://openalex.org/W2752648984","https://openalex.org/W2951277551","https://openalex.org/W3010840979","https://openalex.org/W3021035068","https://openalex.org/W3138237834","https://openalex.org/W4298949291"],"related_works":["https://openalex.org/W2382626982","https://openalex.org/W2376716665","https://openalex.org/W1495725930","https://openalex.org/W1525838894","https://openalex.org/W4295363057","https://openalex.org/W2352621013","https://openalex.org/W1522863580","https://openalex.org/W1618127733","https://openalex.org/W4287829284","https://openalex.org/W3108720720"],"abstract_inverted_index":{"In":[0,116],"the":[1,8,27,30,47,64,76,80,82,93,110,113,135,147,163,180,247,262],"classical":[2,77],"binary":[3,33],"search":[4,34],"in":[5,70,79,239],"a":[6,68,89,105,132,139,151,155,208,232],"path":[7,145],"aim":[9],"is":[10,138,158],"to":[11,29,63,75,141,146,179,228],"detect":[12],"an":[13,71,99,142,159,169,221],"unknown":[14],"target":[15,69,133,152,216],"by":[16,40,125,198,219],"asking":[17],"as":[18,21,205,207],"few":[19],"queries":[20,248],"possible,":[22],"where":[23],"each":[24,96,224],"query":[25,97,136],"reveals":[26],"direction":[28,140],"target.":[31],"This":[32],"algorithm":[35,83],"has":[36,187],"been":[37,188],"recently":[38],"extended":[39],"Emamjomeh-Zadeh":[41,85,126],"et":[42,86,127],"al.":[43,87],"(in:":[44],"Proceedings":[45],"of":[46,55,66,84,112,162,168,182,264,267],"48th":[48],"annual":[49],"ACM":[50],"SIGACT":[51],"symposium":[52],"on":[53,246],"theory":[54],"computing,":[56],"STOC":[57],"2016,":[58],"Cambridge,":[59],"pp.":[60],"519\u2013532,":[61],"2016)":[62],"problem":[65],"detecting":[67,131,150,174,236],"arbitrary":[72],"graph.":[73],"Similarly":[74],"case":[78],"path,":[81],"maintains":[88],"candidates\u2019":[90,114,165],"set":[91,166],"for":[92,177,235,251,261],"target,":[94,148],"while":[95],"asks":[98],"appropriately":[100],"chosen":[101],"vertex\u2014the":[102],"\u201cmedian\u201d\u2014which":[103],"minimises":[104],"potential":[106,210,277],"$$\\varPhi":[107],"$$":[108,212,279],"among":[109],"vertices":[111],"set.":[115],"this":[117],"paper":[118],"we":[119,230,242],"address":[120],"three":[121],"open":[122],"questions":[123,194],"posed":[124],"al.,":[128],"namely":[129],"(a)":[130,195],"when":[134,153],"response":[137],"approximately":[143],"shortest":[144],"(b)":[149,197],"querying":[154,220,282],"vertex":[156],"that":[157,213,249,280],"approximate":[160,222,283],"median":[161,223],"current":[164],"(instead":[167],"exact":[170],"one),":[171],"and":[172,196,202,241,256],"(c)":[173],"multiple":[175],"targets,":[176],"which":[178],"best":[181],"our":[183,268,275],"knowledge":[184],"no":[185],"progress":[186],"made":[189],"so":[190],"far.":[191],"We":[192],"resolve":[193],"providing":[199],"appropriate":[200],"upper":[201,259],"lower":[203,254],"bounds,":[204],"well":[206],"new":[209,276],"$$\\varGamma":[211,278],"guarantees":[214],"efficient":[215],"detection":[217],"even":[218],"time.":[225],"With":[226],"respect":[227],"(c),":[229],"initiate":[231],"systematic":[233],"study":[234],"two":[237],"targets":[238],"graphs":[240],"identify":[243],"sufficient":[244],"conditions":[245],"allow":[250],"strong":[252,257],"(linear)":[253],"bounds":[255,260],"(polylogarithmic)":[258],"number":[263],"queries.":[265],"All":[266],"positive":[269],"results":[270],"can":[271],"be":[272],"derived":[273],"using":[274],"allows":[281],"medians.":[284]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}