{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T05:37:29Z","timestamp":1732081049797,"version":"3.28.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10878-024-01231-w","type":"journal-article","created":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T23:02:04Z","timestamp":1730502124000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum $$ s-t $$ hypercut in (s,\u00a0t)-planar hypergraphs"],"prefix":"10.1007","volume":"48","author":[{"given":"Abolfazl","family":"Hassanpour","sequence":"first","affiliation":[]},{"given":"Massoud","family":"Aman","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Ebrahimi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,1]]},"reference":[{"key":"1231_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1988) Network flows","DOI":"10.21236\/ADA594171"},{"issue":"1\u20132","key":"1231_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"CJ Alpert","year":"1995","unstructured":"Alpert CJ, Kahng AB (1995) Recent directions in netlist partitioning: a survey. Integration 19(1\u20132):1\u201381","journal-title":"Integration"},{"issue":"6295","key":"1231_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"issue":"48","key":"1231_CR4","doi-asserted-by":"publisher","first-page":"11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT, Jadbabaie A, Kleinberg J (2018) Simplicial closure and higher-order link prediction. Proc Nat Acad Sci 115(48):11221\u201311230","journal-title":"Proc Nat Acad Sci"},{"key":"1231_CR5","unstructured":"Benson A, Kleinberg J, Veldt N (2021) Hypergraph cuts with general splitting functions. In: 2021 Joint Mathematics Meetings (JMM). AMS"},{"key":"1231_CR6","doi-asserted-by":"crossref","unstructured":"Bretto A (2013) Hypergraph theory. An introduction. Mathematical Engineering. Cham: Springer 1","DOI":"10.1007\/978-3-319-00080-0_1"},{"key":"1231_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10878-015-9978-3","volume":"33","author":"C Charpentier","year":"2017","unstructured":"Charpentier C, Gravier S, Lecorre T (2017) Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. J Comb Optim 33:543\u2013550","journal-title":"J Comb Optim"},{"key":"1231_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estrada","year":"2006","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Phys A Stat Mech Appl 364:581\u2013594","journal-title":"Phys A Stat Mech Appl"},{"key":"1231_CR9","unstructured":"Feinberg V, Levin A, Rabinovich E (2012) Vlsi planarization: methods, models, implementation 399"},{"key":"1231_CR10","unstructured":"Frank FW (2019) Of the thesis drawing hypergraphs as metro maps. PhD thesis, Informatics Institute"},{"issue":"4","key":"1231_CR11","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J ACM (JACM) 35(4):921\u2013940","journal-title":"J ACM (JACM)"},{"key":"1231_CR12","unstructured":"Gottesb\u00fcren L, Hamann M, Wagner D (2019) Evaluation of a flow-based hypergraph bipartitioning algorithm. arXiv preprint arXiv:1907.02053"},{"key":"1231_CR13","doi-asserted-by":"crossref","unstructured":"Govindu VM (2005) A tensor decomposition for geometric grouping and segmentation. In: 2005 IEEE computer society conference on computer vision and pattern recognition (CVPR\u201905), vol. 1, pp. 1150\u20131157 . IEEE","DOI":"10.1109\/CVPR.2005.50"},{"issue":"2","key":"1231_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(93)E0166-V","volume":"59","author":"SW Hadley","year":"1995","unstructured":"Hadley SW (1995) Approximation techniques for hypergraph partitioning problems. Discrete Appl Math 59(2):115\u2013127","journal-title":"Discrete Appl Math"},{"key":"1231_CR15","doi-asserted-by":"crossref","unstructured":"Hassin R (1981) Maximum flow in (s, t) planar networks","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"1231_CR16","first-page":"1","volume":"26","author":"M Hein","year":"2013","unstructured":"Hein M, Setzer S, Jost L, Rangapuram SS (2013) The total variation on hypergraphs-learning on hypergraphs revisited. Adv Neural Inf Process Syst 26:1\u20139","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"1231_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"MR Henzinger","year":"1997","unstructured":"Henzinger MR, Klein P, Rao S, Subramanian S (1997) Faster shortest-path algorithms for planar graphs. J Comput Syst Sci 55(1):3\u201323","journal-title":"J Comput Syst Sci"},{"key":"1231_CR18","doi-asserted-by":"crossref","unstructured":"Huang Y, Liu Q, Metaxas D (2009) Video object segmentation by hypergraph cut. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1738\u20131745. IEEE","DOI":"10.1109\/CVPR.2009.5206795"},{"key":"1231_CR19","doi-asserted-by":"crossref","unstructured":"Hu T, Xiong H, Zhou W, Sung SY, Luo H (2008) Hypergraph partitioning for document clustering: a unified clique perspective. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 871\u2013872","DOI":"10.1145\/1390334.1390548"},{"issue":"2","key":"1231_CR20","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/TVCG.2020.3030475","volume":"27","author":"B Jacobsen","year":"2020","unstructured":"Jacobsen B, Wallinger M, Kobourov S, N\u00f6llenburg M (2020) Metrosets: visualizing sets as metro maps. IEEE Trans Visual Comput Gr 27(2):1257\u20131267","journal-title":"IEEE Trans Visual Comput Gr"},{"key":"1231_CR21","doi-asserted-by":"crossref","unstructured":"Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: Application in vlsi domain. In: Proceedings of the 34th Annual Design Automation Conference, pp. 526\u2013529","DOI":"10.1145\/266021.266273"},{"key":"1231_CR22","unstructured":"Kim S, Nowozin S, Kohli P, Yoo C (2011) Higher-order correlation clustering for image segmentation. Adv Neural Inf Process Syst 24:1\u20139"},{"key":"1231_CR23","unstructured":"Klimmek R, Wagner F (1996) A simple hypergraph min cut algorithm"},{"issue":"4","key":"1231_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat phys 15(4):313\u2013320","journal-title":"Nat phys"},{"issue":"3","key":"1231_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230030306","volume":"3","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Cutsets and partitions of hypergraphs. Networks 3(3):275\u2013285","journal-title":"Networks"},{"key":"1231_CR26","unstructured":"Li P, Milenkovic O (2017) Inhomogeneous hypergraph clustering with applications. Adv Neural Inf Process Syst 30: 1\u201311"},{"issue":"1","key":"1231_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-9260(00)00008-0","volume":"30","author":"W-K Mak","year":"2000","unstructured":"Mak W-K, Wong D (2000) A fast hypergraph min-cut algorithm for circuit partitioning. Integration 30(1):1\u201311","journal-title":"Integration"},{"issue":"5","key":"1231_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.056111","volume":"86","author":"T Michoel","year":"2012","unstructured":"Michoel T, Nachtergaele B (2012) Alignment and integration of complex networks by hypergraph-based spectral clustering. Phys Rev E 86(5):056111","journal-title":"Phys Rev E"},{"issue":"1","key":"1231_CR29","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi H, Ibaraki T (1992) Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J Discrete Math 5(1):54\u201366","journal-title":"SIAM J Discrete Math"},{"key":"1231_CR30","doi-asserted-by":"crossref","unstructured":"Ochs P, Brox T (2012) Higher order motion models and spectral clustering. In: 2012 IEEE Conference on computer vision and pattern recognition, pp. 614\u2013621. IEEE","DOI":"10.1109\/CVPR.2012.6247728"},{"key":"1231_CR31","doi-asserted-by":"crossref","unstructured":"Porter MA (2020) Nonlinearity+ networks: A 2020 vision. Emerging frontiers in nonlinear science, 131\u2013159","DOI":"10.1007\/978-3-030-44992-6_6"},{"issue":"9","key":"1231_CR32","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1109\/TPAMI.2016.2614980","volume":"39","author":"P Purkait","year":"2016","unstructured":"Purkait P, Chin T-J, Sadri A, Suter D (2016) Clustering with hypergraphs: the case for large hyperedges. IEEE Trans Pattern Anal Mach Intell 39(9):1697\u20131711","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1231_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3529090","volume":"27","author":"S Schlag","year":"2023","unstructured":"Schlag S, Heuer T, Gottesb\u00fcren L, Akhremtsev Y, Schulz C, Sanders P (2023) High-quality hypergraph partitioning. ACM J Exp Algorithmics 27:1\u201339","journal-title":"ACM J Exp Algorithmics"},{"issue":"3","key":"1231_CR34","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TCAD.2005.854637","volume":"25","author":"N Selvakkumaran","year":"2006","unstructured":"Selvakkumaran N, Karypis G (2006) Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization. IEEE Trans Comput Aided Des Integr Circuits Syst 25(3):504\u2013517","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"1","key":"1231_CR35","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1007\/s10878-022-00864-z","volume":"44","author":"GH Shirdel","year":"2022","unstructured":"Shirdel GH, Vaez-Zadeh B (2022) Finding a minimal spanning hypertree of a weighted hypergraph. J Comb Optim 44(1):894\u2013904","journal-title":"J Comb Optim"},{"issue":"4","key":"1231_CR36","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer M, Wagner F (1997) A simple min-cut algorithm. J ACM (JACM) 44(4):585\u2013591","journal-title":"A simple min-cut algorithm. J ACM (JACM)"},{"issue":"9","key":"1231_CR37","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/31.57601","volume":"37","author":"A Vannelli","year":"1990","unstructured":"Vannelli A, Hadley SW (1990) A gomory-hu cut tree representation of a netlist partitioning problem. IEEE Trans Circuits Syst 37(9):1133\u20131139","journal-title":"IEEE Trans Circuits Syst"},{"key":"1231_CR38","unstructured":"Verroust-Blondet A, Viaud M-L (2004) Results on hypergraph planarity"},{"key":"1231_CR39","unstructured":"Voloshin VI (2009) Introduction to graph and hypergraph theory. Nova Science Publishers"},{"issue":"14\u201315","key":"1231_CR40","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1016\/j.ipl.2010.05.003","volume":"110","author":"M Xiao","year":"2010","unstructured":"Xiao M (2010) Finding minimum 3-way cuts in hypergraphs. Inf Process Lett 110(14\u201315):554\u2013558","journal-title":"Inf Process Lett"},{"key":"1231_CR41","unstructured":"Yadati N, Nimishakavi M, Yadav P, Nitin V, Louis A, Talukdar P (2019) Hypergcn: a new method for training graph convolutional networks on hypergraphs. Adv Neural Inf Process Syst 32"},{"issue":"5","key":"1231_CR42","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1109\/TSG.2015.2394791","volume":"6","author":"Y Yamaguchi","year":"2015","unstructured":"Yamaguchi Y, Ogawa A, Takeda A, Iwata S (2015) Cyber security analysis of power networks by hypergraph cut algorithms. IEEE Trans Smart Grid 6(5):2189\u20132199","journal-title":"IEEE Trans Smart Grid"},{"issue":"12","key":"1231_CR43","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1109\/43.552086","volume":"15","author":"HH Yang","year":"1996","unstructured":"Yang HH, Wong D (1996) Balanced partitioning. IEEE Trans Comput Aided Des Integr Circuits Syst 15(12):1533\u20131540","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"1231_CR44","doi-asserted-by":"crossref","unstructured":"Yaros JR, Imielinski T (2013) Imbalanced hypergraph partitioning and improvements for consensus clustering. In: 2013 IEEE 25th International conference on tools with artificial intelligence, pp. 358\u2013365 . IEEE","DOI":"10.1109\/ICTAI.2013.61"},{"key":"1231_CR45","doi-asserted-by":"crossref","unstructured":"Yih J-S, Mazumder P (1989) A neural network design for circuit partitioning. In: Proceedings of the 26th ACM\/IEEE design automation conference, pp. 406\u2013411","DOI":"10.1145\/74382.74450"},{"key":"1231_CR46","doi-asserted-by":"crossref","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hypergraphs: clustering, classification, and embedding. Adv Neural Inf Process Syst19","DOI":"10.7551\/mitpress\/7503.003.0205"},{"issue":"1","key":"1231_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-022-00483-x","volume":"7","author":"Y Zhu","year":"2022","unstructured":"Zhu Y, Segarra S (2022) Hypergraph cuts with edge-dependent vertex weights. Appl Netw Sci 7(1):1\u201320","journal-title":"Appl Netw Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01231-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01231-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01231-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:24:03Z","timestamp":1732051443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01231-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,1]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1231"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01231-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,11,1]]},"assertion":[{"value":"17 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"37"}}