{"id":"https://openalex.org/W1974491459","doi":"https://doi.org/10.1145/2666310.2666474","title":"Fast approximation of reach hierarchies in networks","display_name":"Fast approximation of reach hierarchies in networks","publication_year":2014,"publication_date":"2014-11-04","ids":{"openalex":"https://openalex.org/W1974491459","doi":"https://doi.org/10.1145/2666310.2666474","mag":"1974491459"},"language":"en","primary_location":{"id":"doi:10.1145/2666310.2666474","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2666310.2666474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5042158058","display_name":"Joris Maervoet","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Joris Maervoet","raw_affiliation_strings":["KU Leuven, Gent, Belgium","KU Leuven Gent, BELGIUM,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Gent, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"KU Leuven Gent, BELGIUM,","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074966723","display_name":"Patrick De Causmaecker","orcid":"https://orcid.org/0000-0002-6763-1945"},"institutions":[{"id":"https://openalex.org/I150145467","display_name":"University College West Flanders","ror":"https://ror.org/00fy5v859","country_code":"BE","type":"education","lineage":["https://openalex.org/I150145467"]},{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Patrick De Causmaecker","raw_affiliation_strings":["KU Leuven, Kortrijk, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Kortrijk, Belgium","institution_ids":["https://openalex.org/I150145467","https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051354803","display_name":"Greet Vanden Berghe","orcid":"https://orcid.org/0000-0002-0275-5568"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Greet Vanden Berghe","raw_affiliation_strings":["KU Leuven, Gent, Belgium","KU Leuven Gent, BELGIUM,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Gent, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"KU Leuven Gent, BELGIUM,","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2901,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50044709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"441","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.9952999949455261,"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.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6835442781448364},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6095139384269714},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5974984765052795},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5717437267303467},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5251635909080505},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.5215247273445129},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5192627906799316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4983334541320801},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4916751980781555},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4892597198486328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4827129542827606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3579437732696533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35739582777023315},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3480736017227173},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.344036340713501},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09345343708992004}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6835442781448364},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6095139384269714},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5974984765052795},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5717437267303467},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5251635909080505},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.5215247273445129},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5192627906799316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4983334541320801},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4916751980781555},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4892597198486328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4827129542827606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3579437732696533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35739582777023315},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3480736017227173},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.344036340713501},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09345343708992004},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2666310.2666474","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2666310.2666474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/463280","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/463280/1/fast-app-reach-h-1_2.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Dallas, Texas, USA, 4-7 November 2014","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321454","display_name":"Belgian Federal Science Policy Office","ror":"https://ror.org/01fapfv42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W1500454787","https://openalex.org/W2151400766","https://openalex.org/W2521540678"],"related_works":["https://openalex.org/W1997613377","https://openalex.org/W1930841953","https://openalex.org/W2393730076","https://openalex.org/W3195942359","https://openalex.org/W2885112897","https://openalex.org/W4286247391","https://openalex.org/W2782194400","https://openalex.org/W2012554677","https://openalex.org/W2624428482","https://openalex.org/W2075582476"],"abstract_inverted_index":{"The":[0],"reach":[1,49,87],"of":[2,15,19,23,37,40,61,71],"an":[3,13,43],"arc":[4],"in":[5,42,68,84],"a":[6,62],"network":[7],"can":[8],"intuitively":[9],"be":[10],"described":[11],"as":[12],"indication":[14],"the":[16,20,24,34,72,85],"maximum":[17],"length":[18],"shortest":[21,64],"paths":[22],"digraph":[25],"that":[26],"pass":[27],"through":[28],"this":[29],"arc.":[30],"This":[31],"concept":[32],"captures":[33],"natural":[35],"hierarchy":[36],"any":[38],"type":[39],"network,":[41],"accurate":[44],"and":[45,58],"comprehensive":[46],"manner.":[47],"Traditional":[48],"approximation":[50],"algorithms":[51],"compute":[52],"upper":[53],"bounds":[54],"to":[55,95],"these":[56,79],"reaches":[57,83,91],"require":[59],"computation":[60,77],"partial":[63],"path":[65],"tree":[66],"rooted":[67],"all":[69],"vertices":[70],"network.":[73],"Tailored":[74],"for":[75],"route":[76],"enhancement,":[78],"methods":[80],"yield":[81],"exact":[82],"low":[86],"spectrum,":[88],"whereas":[89],"higher":[90],"are":[92],"kept":[93],"set":[94],"infinity.":[96]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}