{"id":"https://openalex.org/W2254333653","doi":"https://doi.org/10.1145/2896377.2901458","title":"Reverse Ranking by Graph Structure","display_name":"Reverse Ranking by Graph Structure","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2254333653","doi":"https://doi.org/10.1145/2896377.2901458","mag":"2254333653"},"language":"en","primary_location":{"id":"doi:10.1145/2896377.2901458","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2896377.2901458","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2896377.2901458","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2896377.2901458","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089144342","display_name":"Eliav Buchnik","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eliav Buchnik","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026385549","display_name":"Edith Cohen","orcid":"https://orcid.org/0000-0002-3926-8237"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edith Cohen","raw_affiliation_strings":["Tel Aviv University & Google Research, Mountain View, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University & Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9951000213623047,"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.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.6394647359848022},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6089844703674316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5186507105827332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5152926445007324},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4704990088939667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4538775682449341},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4535828232765198},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4443165957927704},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4433276355266571},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4260760247707367},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.421925812959671},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2759283185005188},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2608950436115265},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17986342310905457}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6394647359848022},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6089844703674316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5186507105827332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5152926445007324},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4704990088939667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4538775682449341},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4535828232765198},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4443165957927704},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4433276355266571},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4260760247707367},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.421925812959671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2759283185005188},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2608950436115265},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17986342310905457},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2896377.2901458","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2896377.2901458","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2896377.2901458","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2896377.2901458","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2896377.2901458","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2896377.2901458","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2254333653.pdf","grobid_xml":"https://content.openalex.org/works/W2254333653.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W21006490","https://openalex.org/W1480376833","https://openalex.org/W1680189815","https://openalex.org/W1965996575","https://openalex.org/W1967570846","https://openalex.org/W1975410281","https://openalex.org/W1979819093","https://openalex.org/W1999634786","https://openalex.org/W2001947543","https://openalex.org/W2034543148","https://openalex.org/W2040615703","https://openalex.org/W2056944867","https://openalex.org/W2061820396","https://openalex.org/W2076287166","https://openalex.org/W2084803275","https://openalex.org/W2112615110","https://openalex.org/W2122111042","https://openalex.org/W2126356486","https://openalex.org/W2126709939","https://openalex.org/W2129765035","https://openalex.org/W2131997358","https://openalex.org/W2132801025","https://openalex.org/W2139430401","https://openalex.org/W2141403143","https://openalex.org/W2143284812","https://openalex.org/W2143996311","https://openalex.org/W2151095918","https://openalex.org/W2166470254","https://openalex.org/W2168729706","https://openalex.org/W2404196336","https://openalex.org/W2420733993","https://openalex.org/W2571366332","https://openalex.org/W2666600683","https://openalex.org/W2950468916","https://openalex.org/W2952347589","https://openalex.org/W2962904868","https://openalex.org/W3118655244","https://openalex.org/W3121866901","https://openalex.org/W4233471163","https://openalex.org/W4244343699","https://openalex.org/W7015881123"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":{"Distances":[0],"in":[1,61,77,96],"a":[2,23,27,90,130,165,172],"network":[3,159],"capture":[4],"relations":[5],"between":[6],"nodes":[7,46,65,95],"and":[8,15,73,88,124,127],"are":[9,48],"the":[10,20,36,39,43,57,158],"basis":[11],"of":[12,22,38,45,59,64,86,98,157,167],"centrality,":[13],"similarity,":[14],"influence":[16,122,143],"measures.":[17],"Often,":[18],"however,":[19],"relevance":[21],"node":[24,28],"u":[25,60],"to":[26,50,108,160],"v":[29,51],"is":[30],"more":[31],"precisely":[32],"measured":[33],"not":[34],"by":[35,42,56,66],"magnitude":[37],"distance,":[40],"but":[41],"number":[44],"that":[47],"closer":[49],"than":[52],"u.":[53],"That":[54],"is,":[55],"rank":[58,102],"an":[62],"ordering":[63],"increasing":[67,99],"distance":[68],"from":[69],"v.":[70],"We":[71,81,111,135],"identify":[72],"address":[74],"fundamental":[75],"challenges":[76],"rank-based":[78],"graph":[79],"mining.":[80],"first":[82],"consider":[83],"single-source":[84,150],"computation":[85],"reverse-ranks":[87],"design":[89,146],"\"Dijkstra-like\"":[91],"algorithm":[92,174],"which":[93,116,179],"computes":[94],"order":[97],"approximate":[100,141],"reverse":[101,119],"while":[103],"only":[104],"traversing":[105],"edges":[106],"adjacent":[107],"returned":[109],"nodes.":[110],"then":[112],"define":[113],"reverse-rank":[114,142],"influence,":[115],"naturally":[117],"extends":[118],"nearest":[120],"neighbors":[121],"[Korn":[123],"Muthukrishnan":[125],"2000]":[126],"builds":[128],"on":[129,148,184],"well":[131],"studied":[132],"distance-based":[133],"influence.":[134],"present":[136,171],"near-linear":[137,155],"algorithms":[138,153],"for":[139,175],"greedy":[140],"maximization.":[144],"The":[145],"relies":[147],"our":[149],"algorithm.":[151],"Our":[152],"utilize":[154],"preprocessing":[156],"compute":[161],"all-distance":[162],"sketches.":[163],"As":[164],"contribution":[166],"independent":[168],"interest,":[169],"we":[170],"novel":[173],"computing":[176],"these":[177],"sketches,":[178],"have":[180],"many":[181],"other":[182],"applications,":[183],"multi-core":[185],"architectures.":[186]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}