{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:29:30Z","timestamp":1775028570301,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319491776","type":"print"},{"value":"9783319491783","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49178-3_36","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T02:17:26Z","timestamp":1478657846000},"page":"477-490","source":"Crossref","is-referenced-by-count":5,"title":["A Distributed Algorithm for Balanced Hypergraph Partitioning"],"prefix":"10.1007","author":[{"given":"Wenyin","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/MIC.2013.100","volume":"17","author":"I Saleh","year":"2013","unstructured":"Saleh, I., Wei, T., Blake, M.B.: Social-network-sourced big data analytics. Internet Comput. IEEE 17(5), 62\u201369 (2013)","journal-title":"Internet Comput. IEEE"},{"issue":"4","key":"36_CR2","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1145\/1851275.1851227","volume":"40","author":"JM Pujol","year":"2010","unstructured":"Pujol, J.M., Erramilli, V., Siganos, G., Yang, X., Laoutaris, N., Chhabra, P., Rodriguez, P.: The little engine(s) that could: scaling online social networks. ACM SigComm Comput. Commun. Rev. 40(4), 1162\u20131175 (2010)","journal-title":"ACM SigComm Comput. Commun. Rev."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Jelasity, M., Haridi, S.: Ja-Be-Ja: a distributed algorithm for balanced graph partitioning. In: IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 51\u201360 (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"36_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/2627534.2627563","volume":"41","author":"BCA Heintz","year":"2014","unstructured":"Heintz, B.C.A.: Beyond graphs: toward scalable hypergraph analysis systems. ACM SIGMETRICS Perform. Eval. Rev. 41, 94\u201397 (2014)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"36_CR5","first-page":"1559","volume":"36","author":"W Yang","year":"2015","unstructured":"Yang, W., Wang, G.: Directed social hypergraph data allocation strategy in online socail networks. J. Chin. Comput. Syst. 36, 1559\u20131564 (2015)","journal-title":"J. Chin. Comput. Syst."},{"issue":"11","key":"36_CR6","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1109\/TKDE.2014.2302291","volume":"26","author":"A Turk","year":"2014","unstructured":"Turk, A., Selvitopi, R.O., Ferhatosmanoglu, H., Aykanat, C.: Temporal workload-aware replicated partitioning for social networks. IEEE Trans. Knowl. Data Eng. 26(11), 2832\u20132845 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-04534-4_5","volume-title":"Graph Structures for Knowledge Representation and Reasoning","author":"A Guzzo","year":"2014","unstructured":"Guzzo, A., Pugliese, A., Rullo, A., Sacc\u00e0, D.: Intrusion detection with hypergraph-based attack models. In: Croitoru, M., Rudolph, S., Woltran, S., Gonzales, C. (eds.) GKR 2013. LNCS (LNAI), vol. 8323, pp. 58\u201373. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-04534-4_5"},{"key":"36_CR8","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Usenix Conference on Operating Systems Design and Implementation, pp. 17\u201330 (2012)"},{"issue":"1","key":"36_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.datak.2011.11.004","volume":"72","author":"M Kim","year":"2012","unstructured":"Kim, M., Candan, K.S.: SBV-Cut: vertex-cut based graph partitioning using structural balance vertices. Data Knowl. Eng. 72(1), 285\u2013303 (2012)","journal-title":"Data Knowl. Eng."},{"key":"36_CR10","unstructured":"Guerrieri, A., Montresor, A.: Distributed edge partitioning for graph processing, CoRR abs\/1403.6270"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-662-43352-2_15","volume-title":"Distributed Applications and Interoperable Systems","author":"F Rahimian","year":"2014","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Haridi, S.: Distributed vertex-cut partitioning. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 186\u2013200. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43352-2_15"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-27161-3_7","volume-title":"Algorithms and Architectures for Parallel Processing","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Liu, Y., Yu, J., Liu, P., Guo, L.: VSEP: a distributed algorithm for graph edge partitioning. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9532, pp. 71\u201384. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-27161-3_7"},{"issue":"4","key":"36_CR13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.disopt.2014.11.002","volume":"15","author":"R Bornd\u00f6rfer","year":"2015","unstructured":"Bornd\u00f6rfer, R., Heismann, O.: The hypergraph assignment problem. Discrete Optim. 15(4), 15\u201325 (2015)","journal-title":"Discrete Optim."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Papers on Twenty-five Years of Electronic Design Automation, pp. 175\u2013181. (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"1","key":"36_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. Syst. 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of the 36th annual ACM\/IEEE Design Automation Conference, pp. 343\u2013348 (1999)","DOI":"10.1109\/DAC.1999.781339"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Yaros, J., Imielinski, T.: Imbalanced hypergraph partitioning, improvements for consensus clustering. In: The 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE Press, pp. 358\u2013365 (2013)","DOI":"10.1109\/ICTAI.2013.61"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Yang, W., Wang, G., Bhuiyan, M.Z.A.: Partitioning of hypergraph modeled complex networks based on information entropy. In: Proceedings of the 15th International Conference on Algorithms and Architectures for Parallel Processing, pp. 678\u2013690 (2015)","DOI":"10.1007\/978-3-319-27122-4_47"},{"issue":"4","key":"36_CR19","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.jpdc.2012.01.004","volume":"72","author":"RO Selvitopi","year":"2012","unstructured":"Selvitopi, R.O., Turk, A., Aykanat, C.: Replicated partitioning for undirected hypergraphs. J. Parallel Distrib. Comput. 72(4), 547\u2013563 (2012)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49178-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:08:08Z","timestamp":1498360088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49178-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491776","9783319491783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49178-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}