• DocumentCode
    507141
  • Title

    Betweeness-Centrality of Grid Networks

  • Author

    Rajasingh, Indra ; Rajan, Bharati ; Isido D, F.

  • Author_Institution
    Dept. of Math., Loyola Coll., Chennai, India
  • Volume
    1
  • fYear
    2009
  • fDate
    13-15 Nov. 2009
  • Firstpage
    407
  • Lastpage
    410
  • 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.
  • Keywords
    grid computing; social networking (online); centrality indices; grid network betweeness-centrality; route planning; social network analysis; Algorithm design and analysis; Computer networks; Educational institutions; Grid computing; Joining processes; Mathematics; Social network services; Terrorism; Vehicles; Web pages; betweeness-centrality; grid; social networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Technology and Development, 2009. ICCTD '09. International Conference on
  • Conference_Location
    Kota Kinabalu
  • Print_ISBN
    978-0-7695-3892-1
  • Type

    conf

  • DOI
    10.1109/ICCTD.2009.230
  • Filename
    5359703