{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:58:41Z","timestamp":1758272321495},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transinf.2021fcp0003","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T22:25:38Z","timestamp":1646087138000},"page":"451-458","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Tatsuya","family":"INOHA","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Osaka Prefecture University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"SADAKANE","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"UNO","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Osaka Prefecture University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuma","family":"YONEBAYASHI","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] A.-L. Barab\u00e1si, Network Science, Cambridge University Press, 2016."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A. Bavelas, \u201cCommunication patterns in task-oriented groups,\u201d J. Acoust. Soc. Am., vol.22, no.6, pp.725-730, 1950. 10.1121\/1.1906679","DOI":"10.1121\/1.1906679"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E. Bergamini, H. Meyerhenke, and C.L. Staudt, \u201cApproximating betweenness centrality in large evolving networks,\u201d In the 17th Meeting on Algorithm Engineering and Experiments (ALENEX), pp.133-146, 2015. 10.1137\/1.9781611973754.12","DOI":"10.1137\/1.9781611973754.12"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] U. Brandes, \u201cA faster algorithm for betweenness centrality,\u201d J. Mathematical Sociology, vol.25, no.2, pp.163-177, 2001. 10.1080\/0022250X.2001.9990249","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] U. Brandes and C. Pich, \u201cCentrality estimation in large networks,\u201d Int. J. Bifurcation and Chaos, vol.17, no.07, pp.2303-2318, 2007. 10.1142\/S0218127407018403","DOI":"10.1142\/S0218127407018403"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Brin and L. Page, \u201cThe anatomy of a large-scale hypertextual web search engine,\u201d Computer Networks and ISDN Systems, vol.33, no.1-7, pp.107-117, April 1998. 10.1016\/S0169-7552(98)00110-X","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"7","unstructured":"[7] M. Chimani, C. Gutwenger, M. J\u00fcnger, G.W. Klau, K. Klein, and P. Mutzel, The Open Graph Drawing Framework (OGDF). Chapter 17 in: R. Tamassia (ed.), Handbook of Graph Drawing and Visualization, CRC Press, pp.543-569, 2014. 10.1201\/b15385-20"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T. Coffman, S. Greenblatt, and S. Marcus, \u201cGraph-based technologies for intelligence analysis,\u201d Communications of the ACM, vol.47, no.3, pp.45-47, March 2004. 10.1145\/971617.971643","DOI":"10.1145\/971617.971643"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] A. Del Sol, H. Fujihashi, and P. O'Meara, \u201cTopology of small-world networks of protein-protein complex structures,\u201d Bioinformatics, vol.vol.21, no.8, pp.1311-1315, Jan. 2005. 10.1093\/bioinformatics\/bti167","DOI":"10.1093\/bioinformatics\/bti167"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] L.C. Freeman, \u201cA set of measures of centrality based on betweenness,\u201d Sociometry, vol.40, no.1, pp.35-41, 1977. 10.2307\/3033543","DOI":"10.2307\/3033543"},{"key":"11","unstructured":"[11] C. Gutwenger, \u201cApplication of SPQR-trees in the planarization approach for drawing graphs,\u201d Ph. D Thesis, Dortmund University of Technology, 2010. 10.17877\/DE290R-15654"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] T. Hayashi, T. Akiba, and Y, Yoshida, \u201cFully dynamic betweenness centrality maintenance on massive networks,\u201d In the 42nd Int. Conf. the Very Large Data Bases Endowment (VLDB), vol.9, no.2, pp.48-59, Oct. 2015. 10.14778\/2850578.2850580","DOI":"10.14778\/2850578.2850580"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] J. Hopcroft and R.E. Tarjan, \u201cDividing a graph into triconnected components,\u201d SIAM J. Comput., vol.2, no.3, pp.135-158, 1973. 10.1137\/0202012","DOI":"10.1137\/0202012"},{"key":"14","unstructured":"[14] S. Kintali, \u201cBetweenness centrality: algorithms and lower bounds,\u201d arXiv: 0809.1906v2, 2008."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M.-J. Lee, J. Lee, J.Y. Park, R.H. Choi, and C.-W. Chung, \u201cQUBE: a quick algorithm for updating betweenness centrality,\u201d In the 21st International World Wide Web Conference (WWW), pp.351-360, April 2012. 10.1145\/2187836.2187884","DOI":"10.1145\/2187836.2187884"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T04:00:54Z","timestamp":1646452854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021fcp0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021FCP0003"}}