{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:40:10Z","timestamp":1751193610375,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_9","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:14:59Z","timestamp":1751192099000},"page":"118-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms for\u00a0the\u00a0Maximum k-Balanced Weighted Biclique Problem"],"prefix":"10.1007","author":[{"given":"Jingyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"issue":"11","key":"9_CR1","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TCSI.2007.907875","volume":"54","author":"AA Al-Yamani","year":"2007","unstructured":"Al-Yamani, A.A., Ramsundar, S., Pradhan, D.K.: A defect tolerance scheme for nanotechnology circuits. IEEE Trans. Circ. Syst. I Regul. Pap. 54(11), 2402\u20132409 (2007)","journal-title":"IEEE Trans. Circ. Syst. I Regul. Pap."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the regularity lemma. J. Algorithms 16(1), 80\u2013109 (1994)","DOI":"10.1006\/jagm.1994.1005"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discret. Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Becker, A., Geiger, D.: Approximation algorithms for the loop cutset problem. In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 60\u201368. Elsevier (1994)","DOI":"10.1016\/B978-1-55860-332-5.50013-4"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83(1), 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization: Supplement Volume A, pp. 1\u201374 (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Liu, T.: Maximum edge bicliques in tree convex bipartite graphs. In: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), pp. 47\u201355. Springer (2017)","DOI":"10.1007\/978-3-319-59605-1_5"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient exact algorithms for maximum balanced biclique search in bipartite graphs. In: Proceedings of the 47th International Conference on Management of Data (SIGMOD), pp. 248\u2013260 (2021)","DOI":"10.1145\/3448016.3459241"},{"key":"9_CR9","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), vol.\u00a08, pp. 93\u2013103 (2000)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M Dawande","year":"2001","unstructured":"Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41(2), 388\u2013403 (2001)","journal-title":"J. Algorithms"},{"key":"9_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of np-Completeness, Freeman. Fundamental (1997)"},{"key":"9_CR12","first-page":"116","volume":"38","author":"D K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok 38, 116\u2013119 (1931)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Li, J., Sim, K., Liu, G., Wong, L.: Maximal quasi-bicliques with balanced noise tolerance: concepts and co-clustering applications. In: Proceedings of the 8th SIAM International Conference on Data Mining (SDM), pp. 72\u201383. SIAM (2008)","DOI":"10.1137\/1.9781611972788.7"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"104922","DOI":"10.1016\/j.cor.2020.104922","volume":"119","author":"M Li","year":"2020","unstructured":"Li, M., Hao, J.-K., Wu, Q.: General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem. Comput. Oper. Res. 119, 104922 (2020)","journal-title":"Comput. Oper. Res."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. Proc. VLDB Endowment 13(9), 1359\u20131372 (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Prosser, P.: An exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: Proceedings of the 11th International Conference Integration of AI and OR Techniques in Constraint Programming (CPAIOR), pp. 226\u2013234. Springer (2014)","DOI":"10.1007\/978-3-319-07046-9_16"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00453-010-9486-x","volume":"64","author":"D Nussbaum","year":"2012","unstructured":"Nussbaum, D., Pu, S., Sack, J.-R., Uno, T., Zarrabi-Zadeh, H.: Finding maximum edge bicliques in convex bipartite graphs. Algorithmica 64, 311\u2013325 (2012)","journal-title":"Algorithmica"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Pandey, A., Sharma, G., Jain, N.: Maximum weighted edge biclique problem on bipartite graphs. In: Proceedings of the 6th Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pp. 116\u2013128. Springer (2020)","DOI":"10.1007\/978-3-030-39219-2_10"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discret. Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Discret. Appl. Math."},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11704-019-8231-0","volume":"14","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Xu, Y., Zhao, H., Zhou, Z., Han, H.: Most similar maximal clique query on large graphs. Front. Comp. Sci. 14, 1\u201316 (2020)","journal-title":"Front. Comp. Sci."},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1137\/0217045","volume":"17","author":"SS Ravi","year":"1988","unstructured":"Ravi, S.S., Lloyd, E.L.: The complexity of near-optimal programmable logic array folding. SIAM J. Comput. 17(4), 696\u2013710 (1988)","journal-title":"SIAM J. Comput."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Shaham, E., Yu, H., Li, X.: On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach. In: Proceedings of the 16th SIAM International Conference on Data Mining (SDM), pp. 315\u2013323. SIAM (2016)","DOI":"10.1137\/1.9781611974348.36"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1002\/jgt.22104","volume":"85","author":"L Shi","year":"2017","unstructured":"Shi, L., Xu, H.: Large induced forests in graphs. J. Graph Theory 85(4), 759\u2013779 (2017)","journal-title":"J. Graph Theory"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"S\u00f6zdinler, M., \u00d6zturan, C.: Finding maximum edge biclique in bipartite networks by integer programming. In: Proceedings of the 21st IEEE International Conference on Computational Science and Engineering (CSE), pp. 132\u2013137. IEEE (2018)","DOI":"10.1109\/CSE.2018.00025"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/1167943.1167945","volume":"2","author":"MB Tahoori","year":"2006","unstructured":"Tahoori, M.B.: Application-independent defect tolerance of reconfigurable nanoarchitectures. ACM J. Emerg. Technol. Comput. Syst. 2(3), 197\u2013218 (2006)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Takaoka, A., Tayu, S., Ueno, S.: On minimum feedback vertex sets in bipartite graphs and degree-constraint graphs. IEICE Trans. Inf. Syst. E96.D(11), 2327\u20132332 (2013)","DOI":"10.1587\/transinf.E96.D.2327"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"9_CR28","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discret. Math. 72(1\u20133), 355\u2013360 (1988)","journal-title":"Discret. Math."},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ins.2017.12.012","volume":"432","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Cai, S., Yin, M.: New heuristic approaches for maximum balanced biclique problem. Inf. Sci. 432, 362\u2013375 (2018)","journal-title":"Inf. Sci."},{"issue":"3","key":"9_CR30","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.-K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Xia, X., Peng, X., Liao, W.: On the analysis of ant colony optimization for the maximum independent set problem. Front. Comp. Sci. 15(4), 1\u20133 (2021)","DOI":"10.1007\/s11704-020-9464-7"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ic.2017.06.001","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Inf. Comput. 255, 126\u2013146 (2017)","journal-title":"Inf. Comput."},{"issue":"05","key":"9_CR33","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1142\/S0218213005002387","volume":"14","author":"J Yang","year":"2005","unstructured":"Yang, J., Wang, H., Wang, W., Yu, P.S.: An improved biclustering method for analyzing gene expression profiles. Int. J. Artif. Intell. Tools 14(05), 771\u2013789 (2005)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Yuan, B., Li, B.: A low time complexity defect-tolerance algorithm for nanoelectronic crossbar. In: Proceedings of the 1st International Conference on Information Science and Technology (ICIST), pp. 143\u2013148. IEEE (2011)","DOI":"10.1109\/ICIST.2011.5765228"},{"issue":"3","key":"9_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2517137","volume":"10","author":"B Yuan","year":"2014","unstructured":"Yuan, B., Li, B.: A fast extraction algorithm for defect-free subcrossbar in nanoelectronic crossbar. ACM J. Emerg. Technol. Comput. Syst. 10(3), 1\u201319 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"issue":"5","key":"9_CR36","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TCYB.2014.2343966","volume":"45","author":"B Yuan","year":"2015","unstructured":"Yuan, B., Li, B., Chen, H., Yao, X.: A new evolutionary algorithm with structure mutation for the maximum balanced biclique problem. IEEE Trans. Cybern. 45(5), 1054\u20131067 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"8","key":"9_CR37","first-page":"7994","volume":"35","author":"Y Zhao","year":"2023","unstructured":"Zhao, Y., Chen, Z., Chen, C., Wang, X., Lin, X., Zhang, W.: Finding the maximum $$ k $$-balanced biclique on weighted bipartite graphs. IEEE Trans. Knowl. Data Eng. 35(8), 7994\u20138007 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.engappai.2018.09.017","volume":"77","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Hao, J.-K.: Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. Eng. Appl. Artif. Intell. 77, 86\u201397 (2019)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"9_CR39","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.ejor.2018.03.010","volume":"269","author":"Y Zhou","year":"2018","unstructured":"Zhou, Y., Rossi, A., Hao, J.-K.: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs. Eur. J. Oper. Res. 269(3), 834\u2013843 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:05Z","timestamp":1751192105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}