{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:39:15Z","timestamp":1648597155281},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T00:00:00Z","timestamp":1316476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10852-011-9163-3","type":"journal-article","created":{"date-parts":[[2011,9,19]],"date-time":"2011-09-19T16:15:32Z","timestamp":1316448932000},"page":"371-391","source":"Crossref","is-referenced-by-count":1,"title":["Snapshot Centrality Indices in Dynamic FIFO Networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Tatiana M.","family":"Tabirca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cormac J.","family":"Sreenan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,20]]},"reference":[{"key":"9163_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, A., Hassanien, A.E., Snasel, V.: Computational Social Network Analysis. Springer (2010)","DOI":"10.1007\/978-1-84882-229-0"},{"key":"9163_CR2","unstructured":"Ahuja, R.K., Magnanti, L.T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)"},{"key":"9163_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Orlin, J., Pallottino, S., Scutella, M.G.: Dynamic Shortest Paths Minimizing Travel Times and Costs. MIT Sloan Working Paper No. 4390-02 (2002)","DOI":"10.2139\/ssrn.344442"},{"key":"9163_CR4","doi-asserted-by":"crossref","unstructured":"Barnes, M., Leather, H., Arvind, D.K.: Emergency evacuation using wireless sensor networks. In: Proceedings of the 32nd IEEE Conference on Local Computer Networks (LCN 2007), pp.\u00a0851\u2013857 (2007)","DOI":"10.1109\/LCN.2007.48"},{"key":"9163_CR5","doi-asserted-by":"crossref","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. J. Math. Sociol. 25, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"2","key":"9163_CR6","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes, U.: On variants of shortest-path betweenness centrality and their generic computation. Soc. Netw. 30(2), 136\u2013145 (2008)","journal-title":"Soc. Netw."},{"key":"9163_CR7","doi-asserted-by":"crossref","unstructured":"Chabini, I.: A new shortest path algorithm for discrete dynamic networks. In: Proceedings of the 8th IFAC Symposium on Transport Systems, pp.\u00a0551\u2013556. Chania, Greece, 16\u201317 June 1997","DOI":"10.1016\/S1474-6670(17)43876-6"},{"key":"9163_CR8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transp. Res. Rec. 1645, 170\u2013175 (1998)","journal-title":"Transp. Res. Rec."},{"key":"9163_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14, 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"9163_CR10","unstructured":"Dean, B.C.: Shortest Paths in FIFO Time-dependent Networks: Theory and Algorithms. Technical Report, MIT Department of Computer Science (2004)"},{"issue":"5","key":"9163_CR11","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.jcss.2005.05.005","volume":"72","author":"C Demetrescu","year":"2006","unstructured":"Demetrescu, C., Italiano, G.F.: Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5), 813\u2013837 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9163_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"9163_CR13","doi-asserted-by":"crossref","unstructured":"Gross, T., Sayama, H.: Adaptive Networks: Theory, Models and Applications. Springer (2009)","DOI":"10.1007\/978-3-642-01284-6"},{"key":"9163_CR14","unstructured":"Habiba, Tantipathananandh, C., Berger-Wolf, T.Y.: Betweenness Centrality Measure in Dynamic Networks. DIMACS Technical Report 2007-19 (2007)"},{"key":"9163_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0378-8733(94)00248-9","volume":"17","author":"P Hage","year":"1995","unstructured":"Hage, P., Harary, F.: Eccentricity and centrality in networks. Soc. Netw. 17, 57\u201363 (1995)","journal-title":"Soc. Netw."},{"key":"9163_CR16","doi-asserted-by":"crossref","unstructured":"Jacob, R., Koschtzki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for centrality indices. In: Network Analysis, Methodological Foundations, LNCS 3418\/2005, pp. 62\u201382 (2005)","DOI":"10.1007\/978-3-540-31955-9_4"},{"key":"9163_CR17","doi-asserted-by":"crossref","unstructured":"Lerman, K., Ghosh, R., Kang, J.H.: Centrality metric for dynamic networks. In: Proceedings of the 8th Workshop on Mining and Learning with Graphs (2010)","DOI":"10.1145\/1830252.1830262"},{"key":"9163_CR18","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"9163_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"key":"9163_CR20","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi, G.: The centrality index of a graph. Psychometrika 31, 581\u2013603 (1966)","journal-title":"Psychometrika"},{"key":"9163_CR21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF02476438","volume":"15","author":"A Shimbel","year":"1953","unstructured":"Shimbel, A.: Structural parameters of communication networks. Bull. Math. Biophys. 15, 501 (1953)","journal-title":"Bull. Math. Biophys."},{"key":"9163_CR22","doi-asserted-by":"crossref","unstructured":"Tabirca, T., Brown,K.N., Sreenan, C.J.: A dynamic model for fire emergency evacuation based on wireless sensor networks. In: Proceedings of the 2009 ISPDC Conference, pp. 29\u201336 (2009)","DOI":"10.1109\/ISPDC.2009.33"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9163-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-011-9163-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9163-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T15:58:00Z","timestamp":1638719880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-011-9163-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,20]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9163"],"URL":"https:\/\/doi.org\/10.1007\/s10852-011-9163-3","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,20]]}}}