Presentation 2017-10-27
Betweenness Computation using Graph Compression
Kazuharu Aramaki, Nattapong Kitsuwan, Eiji Oki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Computation method for the betweenness centrality of every vertex in a graph is proposed in this paper. The proposed method compresses the graph by removing vertices with one degree. The compressed graph speeds up the calculation of the betweenness centrality.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Betweenness centrality / graph analytics / graph compression / complex network
Paper # NS2017-108
Date of Issue 2017-10-19 (NS)

Conference Information
Committee NS
Conference Date 2017/10/26(2days)
Place (in Japanese) (See Japanese page)
Place (in English) I-site nanba
Topics (in Japanese) (See Japanese page)
Topics (in English) Network Architecture (Overlay, P2P, Ubiquitous NW, Scale-free NW, Active NW, NGN/NwGN), Next Generation Packet Transport (High-speed Ethernet, IP over WDM, Multi-Service Packet Technologies, MPLS), Grid, etc.
Chair Hideki Tode(Osaka Pref. Univ.)
Vice Chair Yoshikatsu Okazaki(NTT)
Secretary Yoshikatsu Okazaki(Kyushu Inst. of Tech.)
Assistant Kenichi Kashibuchi(NTT)

Paper Information
Registration To Technical Committee on Network Systems
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Betweenness Computation using Graph Compression
Sub Title (in English)
Keyword(1) Betweenness centrality
Keyword(2) graph analytics
Keyword(3) graph compression
Keyword(4) complex network
1st Author's Name Kazuharu Aramaki
1st Author's Affiliation The University of Electro-Communications(UEC)
2nd Author's Name Nattapong Kitsuwan
2nd Author's Affiliation The University of Electro-Communications(UEC)
3rd Author's Name Eiji Oki
3rd Author's Affiliation Kyoto University(Kyoto-u)
Date 2017-10-27
Paper # NS2017-108
Volume (vol) vol.117
Number (no) NS-262
Page pp.pp.83-87(NS),
#Pages 5
Date of Issue 2017-10-19 (NS)