{"doi":"10.1016/j.procs.2015.11.011","title":"Heuristic Algorithm for Approximation Betweenness Centrality Using Graph Coarsening","abstract":null,"journal":"Procedia Computer Science","year":2015,"id":20646,"datarank":0.5918687100437626,"base_score":2.4849066497880004,"endowment":2.4849066497880004,"self_citation_contribution":0.37273599746820013,"citation_network_contribution":0.2191327125755625,"self_endowment_contribution":0.37273599746820013,"citer_contribution":0.2191327125755625,"corpus_percentile":null,"corpus_rank":null,"citation_count":11,"citer_count":11,"citers_with_citation_signal":8,"citers_with_endowment":8,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":135755,"name":"Yves Ineichen","orcid":null,"position":1,"is_corresponding":false},{"id":135756,"name":"Costas Bekas","orcid":null,"position":2,"is_corresponding":false},{"id":135754,"name":"Mikhail Chernoskutov","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.4849066497880004,"endowment":2.4849066497880004,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2186710387","authors":[],"funders":[],"total_grants":0,"fwci":0.7242,"citation_percentile":0.72365199,"influential_citations":0,"citation_trend":[{"year":2016,"count":1},{"year":2018,"count":2},{"year":2019,"count":1},{"year":2020,"count":2},{"year":2022,"count":2},{"year":2024,"count":1},{"year":2026,"count":2}],"oa_status":"gold","license":"cc-by-nc-nd","oa_locations":[{"url":"https://doi.org/10.1016/j.procs.2015.11.011","host_type":"journal"},{"url":"https://doi.org/10.1016/j.procs.2015.11.011","host_type":"GOLD"},{"url":"https://doi.org/10.1016/j.procs.2015.11.011","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S1877050915033608?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S1877050915033608?httpAccept=text/plain","host_type":"publisher"},{"url":"http://elar.urfu.ru/handle/10995/75633","host_type":"repository"},{"url":"http://hdl.handle.net/10995/75633","host_type":"repository"},{"url":"https://elar.urfu.ru/bitstream/10995/75633/1/2-s2.0-84962648734.pdf","host_type":"repository"}],"fields_of_study":["Complex Network Analysis Techniques","Opinion Dynamics and Social Influence","Mental Health Research Topics","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Betweenness centrality","Centrality","Computer science","Network science","Computation","Theoretical computer science","Network controllability","Speedup","Graph","Katz centrality","Vertex (graph theory)","Metric (unit)","Algorithm","Complex network","Mathematics","Combinatorics","Parallel computing"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Decent work and economic growth"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T06:43:11.091540Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}