{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:53:45Z","timestamp":1780383225387,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249986","type":"print"},{"value":"9783540318569","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_44","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"533-544","source":"Crossref","is-referenced-by-count":188,"title":["Centrality Measures Based on Current Flow"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Fleischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Anthonisse, J.M.: The rush in a directed graph. Technical Report\u00a0BN\u00a09\/71, Stichting Mathematisch Centrum, Amsterdam (1971)"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/bs.3830100205","volume":"10","author":"M.A. Beauchamp","year":"1965","unstructured":"Beauchamp, M.A.: An improved index of centrality. Behavioral Science\u00a010, 161\u2013163 (1965)","journal-title":"Behavioral Science"},{"key":"44_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, Heidelberg (1998)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P.: Centrality and Network Flow. Social Networks (to appear)","DOI":"10.1016\/j.socnet.2004.11.008"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology\u00a025, 163\u2013177 (2001)","journal-title":"Journal of Mathematical Sociology"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Cuthill, E.H., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th ACM National Conference, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. Diaz","year":"2002","unstructured":"Diaz, J., Petit, J., Serna, M.: A Survey of Graph Layout Problems. ACM Comput. Surv.\u00a034, 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry\u00a040, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","volume":"13","author":"L.C. Freeman","year":"1991","unstructured":"Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: A measure of betweenness based on network flow. Social Networks\u00a013, 141\u2013154 (1991)","journal-title":"Social Networks"},{"key":"44_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Heidelberg (2001)"},{"key":"44_CR12","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1983)"},{"key":"44_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4288-8","volume-title":"Iterative Solution of Large Sparse Systems of Equations","author":"W. Hackbusch","year":"1994","unstructured":"Hackbusch, W.: Iterative Solution of Large Sparse Systems of Equations. Springer, Heidelberg (1994)"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path width. Information Processing Letters\u00a042, 345\u2013350 (1992)","journal-title":"Information Processing Letters"},{"key":"44_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G. Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: \u00dcber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchung der Linearen Vertheilung galvanischer Str\u00f6me gef\u00fchrt wird. Ann. Phys. Chem.\u00a072, 497\u2013508 (1847)","journal-title":"Ann. Phys. Chem."},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T. Lengauer","year":"1981","unstructured":"Lengauer, T.: Black-white pebbles and graph separation. Acta Informatica\u00a016, 465\u2013475 (1981)","journal-title":"Acta Informatica"},{"key":"44_CR18","unstructured":"Newman, M.E.J.: A Measure of betweenness centrality based on random walks (2003), \n                    \n                      http:\/\/arxiv.org\/abs\/cond-mat\/0309045"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/62044.62051","volume":"36","author":"A. Rosenthal","year":"1989","unstructured":"Rosenthal, A., Pino, J.A.: A generalized algorithm for centrality problems on trees. Journal of the ACM\u00a036, 349\u2013381 (1989)","journal-title":"Journal of the ACM"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K.A. Stephenson","year":"1989","unstructured":"Stephenson, K.A., Zelen, M.: Rethinking centrality: methods and examples. Social Networks\u00a011, 1\u201337 (1989)","journal-title":"Social Networks"},{"key":"44_CR21","unstructured":"Wang, J., Eppstein, D.: Fast approximation of centrality. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 228\u2013229 (2001)"},{"key":"44_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:29:51Z","timestamp":1605760191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}