"Efficient Computation of Betweenness Centrality by Graph Decompositions ..."

Tatsuya Inoha et al. (2022)

> Home

Details and statistics

DOI: 10.1587/TRANSINF.2021FCP0003

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicetd/InohaSUY22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicetd/InohaSUY22
Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi:
Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. IEICE Trans. Inf. Syst. 105-D(3): 451-458 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.