{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:07:43Z","timestamp":1743034063842,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319217857"},{"type":"electronic","value":"9783319217864"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21786-4_11","type":"book-chapter","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T04:06:09Z","timestamp":1438229169000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clustering 1-Dimensional Periodic Network Using Betweenness Centrality"],"prefix":"10.1007","author":[{"given":"Norie","family":"Fu","sequence":"first","affiliation":[]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,31]]},"reference":[{"key":"11_CR1","unstructured":"Anderegg, L., Eidenbenz, S., Gantenbein, M., Stamm, C., Taylor, D.S., Weber, B., Widmeyer, P.: Train routing algorithms: Concepts, design choices, and practical considerations. Proc. ALENEX 2003, pp. 106\u2013118 (2003)"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.jnca.2011.06.001","volume":"35","author":"A Cuzzocrea","year":"2012","unstructured":"Cuzzocrea, A., Papadimitriou, A., Katsaros, D., Manolopoulos, Y.: Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks. Journal of Network and Computer Applications 35(4), 1210\u20131217 (2012)","journal-title":"Journal of Network and Computer Applications"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1186\/1471-2105-6-39","volume":"6","author":"R Dunn","year":"2005","unstructured":"Dunn, R., Dudbridge, F., Sanderson, C.: The use of edge-betweenness clustering to investigate biological function in protein interaction networks. BMC Bioinformatics 6(1), 39 (2005)","journal-title":"BMC Bioinformatics"},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"e107878","DOI":"10.1371\/journal.pone.0107878","volume":"9","author":"J Fournet","year":"2014","unstructured":"Fournet, J., Barrat, A.: Contact patterns among high school students. PLoS ONE 9(9), e107878 (2014)","journal-title":"PLoS ONE"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Freeman, L.: A set of measures of centrality based on betweenness. Sociometry, 35\u201341 (1977)","DOI":"10.2307\/3033543"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-35261-4_42","volume-title":"Algorithms and Computation","author":"N Fu","year":"2012","unstructured":"Fu, N.: A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 392\u2013401. Springer, Heidelberg (2012)"},{"key":"11_CR7","unstructured":"Fu, N., Aguaza, A.J.G., Suppakitpaisarn, V.: Betweenness centrality for 1-dimensional periodic graphs. (manuscript in preparation)"},{"key":"11_CR8","unstructured":"Fu, N., Suppakitpaisarn, V.: The betweenness centrality on 1-dimensional periodic graphs. In: CG Week 2014 - Workshop on Geometric Structures with Symmetry and Periodicity (2014)"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1137\/S0097539792234378","volume":"24","author":"F H\u00f6fting","year":"1995","unstructured":"H\u00f6fting, F., Wanke, E.: Minimum cost paths in periodic graphs. SIAM Journal on Computing 24(5), 1051\u20131067 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Hossmann, T., Legendre, F., Carta, P., Gunningberg, P., Rohner, C.: Twitter in disaster mode: opportunistic communication and distribution of sensor data in emergencies. In: Proc. ExtremeCom 2011, pp. 1:1\u20131:6 (2011)","DOI":"10.1145\/2414393.2414394"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230180307","volume":"18","author":"K Iwano","year":"1988","unstructured":"Iwano, K., Steiglitz, K.: Planarity testing of doubly periodic infinite graphs. Networks 18, 205\u2013222 (1988)","journal-title":"Networks"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Orlin, J.: Some problems on dynamic\/periodic graphs. Progress in Combinatorial Optimization, pp. 273\u2013293 (1984)","DOI":"10.1016\/B978-0-12-566780-7.50022-2"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/opre.30.4.760","volume":"30","author":"JB Orlin","year":"1982","unstructured":"Orlin, J.B.: Minimizing the number of vehicles to meet a fixed periodic schedule: An application of periodic posets. Operations Research 30(4), 760\u2013776 (1982)","journal-title":"Operations Research"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BF02591946","volume":"27","author":"JB Orlin","year":"1983","unstructured":"Orlin, J.B.: Maximum-throughput dynamic network flows. Mathematical Programming 27(2), 214\u2013231 (1983)","journal-title":"Mathematical Programming"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/moor.9.2.190","volume":"9","author":"JB Orlin","year":"1984","unstructured":"Orlin, J.B.: Minimum convex cost dynamic network flows. Mathematics of Operations Research 9(2), 190\u2013207 (1984)","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.pmcj.2012.10.005","volume":"9","author":"Y Sekimoto","year":"2013","unstructured":"Sekimoto, Y., Watanabe, A., Nakamura, T., Kanasugi, H., Usui, T.: Combination of spatio-temporal correction methods using traffic survey data for reconstruction of people flow. Pervasive and Mobile Computing 9(5), 629\u2013642 (2013)","journal-title":"Pervasive and Mobile Computing"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2(4), 550\u2013581 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"7","key":"11_CR18","doi-asserted-by":"publisher","first-page":"e22557","DOI":"10.1371\/journal.pone.0022557","volume":"6","author":"J Yang","year":"2011","unstructured":"Yang, J., Chen, Y.: Fast computing betweenness centrality with virtual nodes on large sparse networks. PloS ONE 6(7), e22557 (2011)","journal-title":"PloS ONE"}],"container-title":["Lecture Notes in Computer Science","Computational Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21786-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:19:05Z","timestamp":1675138745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21786-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319217857","9783319217864"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21786-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"31 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}