{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:45:51Z","timestamp":1743011151629,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_9","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite Communities via Spectral Partitioning"],"prefix":"10.1007","author":[{"given":"Kelly B.","family":"Yancey","sequence":"first","affiliation":[]},{"given":"Matthew P.","family":"Yancey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"5","key":"9_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2775105","volume":"62","author":"S Arora","year":"2015","unstructured":"Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. J. ACM 62(5), 25 (2015). https:\/\/doi.org\/10.1145\/2775105. Art. 42","journal-title":"J. ACM"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.4310\/CAG.2013.v21.n4.a2","volume":"21","author":"F Bauer","year":"2013","unstructured":"Bauer, F., Jost, J.: Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operator. Commun. Anal. Geom. 21(4), 787\u2013845 (2013). https:\/\/doi.org\/10.4310\/CAG.2013.v21.n4.a2","journal-title":"Commun. Anal. Geom."},{"issue":"8","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1101\/gr.117176.110","volume":"21","author":"J Bellay","year":"2011","unstructured":"Bellay, J., et al.: Putting genetic interactions in context through a global modular decomposition. Genome Res. 21(8), 1375\u20131387 (2011). https:\/\/doi.org\/10.1101\/gr.117176.110","journal-title":"Genome Res."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6_4","volume-title":"Algorithm Engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 117\u2013158. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_4"},{"key":"9_CR5","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science. FOCS 1998, p. 379. IEEE Computer Society, Washington, DC (1998). http:\/\/dl.acm.org\/citation.cfm?id=795664.796406"},{"key":"9_CR6","unstructured":"Chung, F.: Four Cheeger-type inequalities for graph partitioning algorithms. In: Proceedings of ICCM, pp. 751\u2013772 (2007)"},{"key":"9_CR7","unstructured":"Gallier, J.: Spectral theory of unsigned and signed graphs. Applications to graph clustering: a survey. ArXiv e-prints, January 2016"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1137\/1.9781611973402.93","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Shayan Oveis Gharan","year":"2013","unstructured":"Gharan, S.O., Trevisan, L.: Partitioning into expanders. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1256\u20131266. ACM, New York (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.93"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999). https:\/\/doi.org\/10.1145\/324133.324140","journal-title":"J. ACM"},{"key":"9_CR10","unstructured":"Kolev, P., Mehlhorn, K.: A note on spectral clustering. In: 24th Annual European Symposium on Algorithms. Leibniz International Proceedings in Informatics, LIPIcs, vol. 57, p. 14, Art. No. 57. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2016)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Lee, J.R., Oveis Gharan, S., Trevisan, L.: Multi-way spectral partitioning and higher-order Cheeger inequalities. In: Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC 2012, pp. 1117\u20131130. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2213977.2214078","DOI":"10.1145\/2213977.2214078"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-642-45030-3_61","volume-title":"Algorithms and Computation","author":"A Li","year":"2013","unstructured":"Li, A., Peng, P.: Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 655\u2013665. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_61"},{"issue":"12","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19(12), 1625\u20131637 (2007). https:\/\/doi.org\/10.1109\/TKDE.2007.190660","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR14","unstructured":"Liu, F.M.A.S.: Cheeger constants, structural balance, and spectral clustering analysis for signed graphs. Max Planck Institute for Mathematics in the Sciences (2014, Preprint). http:\/\/www.mis.mpg.de\/de\/publications\/preprints\/2014\/prepr2014-111.html"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.aim.2014.09.023","volume":"268","author":"S Liu","year":"2015","unstructured":"Liu, S.: Multi-way dual Cheeger constants and spectral bounds of graphs. Adv. Math. 268, 306\u2013338 (2015). https:\/\/doi.org\/10.1016\/j.aim.2014.09.023","journal-title":"Adv. Math."},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.ipm.2012.12.009","volume":"49","author":"D Lo","year":"2013","unstructured":"Lo, D., Surian, D., Prasetyo, P.K., Zhang, K., Lim, E.P.: Mining direct antagonistic communities in signed social networks. Inf. Process. Manag. 49(4), 773\u2013791 (2013). https:\/\/doi.org\/10.1016\/j.ipm.2012.12.009","journal-title":"Inf. Process. Manag."},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Louis, A., Raghavendra, P., Tetali, P., Vempala, S.: Many sparse cuts via higher eigenvalues. In: Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC 2012, pp. 1131\u20131140. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2213977.2214079","DOI":"10.1145\/2213977.2214079"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2010.08.012","volume":"211","author":"MCV Nascimento","year":"2011","unstructured":"Nascimento, M.C.V., de Carvalho, A.C.P.L.F.: Spectral methods for graph clustering \u2013 a survey. Eur. J. Oper. Res. 211(2), 221\u2013231 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2010.08.012","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/15M1047209","volume":"46","author":"R Peng","year":"2017","unstructured":"Peng, R., Sun, H., Zanetti, L.: Partitioning well-clustered graphs: spectral clustering works!. SIAM J. Comput. 46(2), 710\u2013743 (2017). https:\/\/doi.org\/10.1137\/15M1047209","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.1214\/11-AOS887","volume":"39","author":"K Rohe","year":"2011","unstructured":"Rohe, K., Chatterjee, S., Yu, B.: Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Stat. 39(4), 1878\u20131915 (2011). https:\/\/doi.org\/10.1214\/11-AOS887","journal-title":"Ann. Stat."},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1137\/090773714","volume":"41","author":"L Trevisan","year":"2012","unstructured":"Trevisan, L.: Max cut and the smallest eigenvalue. SIAM J. Comput. 41(6), 1769\u20131786 (2012). https:\/\/doi.org\/10.1137\/090773714","journal-title":"SIAM J. Comput."},{"key":"9_CR22","unstructured":"Verma, D., Meila, M.: A comparison of spectral clustering algorithms. Technical report, University of Washington CSE (2003)"},{"key":"9_CR23","unstructured":"Wolf, R.D.: A brief introduction to Fourier analysis on the Boolean cube. Theory of Computing Library Graduate Surveys (2008)"},{"key":"9_CR24","unstructured":"Yancey, K., Yancey, M.: Bipartite Communities. ArXiv e-prints, December 2014"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:47:25Z","timestamp":1710344845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}