{"doi":"10.1109/icctd.2009.230","title":"Betweeness-Centrality of Grid Networks","abstract":null,"journal":"2009 International Conference on Computer Technology and Development","year":2009,"id":600098,"datarank":0.4493598410330987,"base_score":2.995732273553991,"endowment":2.995732273553991,"self_citation_contribution":0.4493598410330987,"citation_network_contribution":0.0,"self_endowment_contribution":0.4493598410330987,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":19,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"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":1538277,"name":"Bharati Rajan","orcid":null,"position":1,"is_corresponding":false},{"id":1538279,"name":"Florence Isido D.","orcid":null,"position":2,"is_corresponding":false},{"id":1538276,"name":"Indra Rajasingh","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Betweeness-Centrality of Grid Networks","abstract":"Importance of estimating the centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications such as social network analysis or route planning. In this paper we find a formula to obtain the betweeness-centrality for grids.","is_dataset_classified":null,"base_score":2.995732273553991,"endowment":2.995732273553991,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W2097992793","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2012,"count":2},{"year":2013,"count":1},{"year":2014,"count":1},{"year":2016,"count":2},{"year":2017,"count":1},{"year":2018,"count":2},{"year":2019,"count":1},{"year":2020,"count":1},{"year":2022,"count":1},{"year":2023,"count":2},{"year":2025,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/5359672/5359673/05359703.pdf?arnumber=5359703","host_type":"publisher"},{"url":"https://doi.org/10.1109/icctd.2009.230","host_type":""}],"fields_of_study":["Complex Network Analysis Techniques","Peer-to-Peer Network Technologies","Graph theory and applications"],"mesh_terms":[],"keywords":["Betweenness centrality","Centrality","Computer science","Node (physics)","Grid","Katz centrality","Network theory","Theoretical computer science","Mathematics","Statistics","Engineering"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Sustainable cities and communities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-29T12:13:04.670258Z","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":[]}