{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:28:05Z","timestamp":1768109285269,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319320489","type":"print"},{"value":"9783319320496","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-32049-6_14","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:36Z","timestamp":1458809256000},"page":"218-233","source":"Crossref","is-referenced-by-count":56,"title":["Bitruss Decomposition of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Zhaonian","family":"Zou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/080729256","volume":"40","author":"C Amb\u00fchl","year":"2011","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40(2), 567\u2013596 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"key":"14_CR3","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Technical report, National Security Agency Technical Report (2008)"},{"issue":"1","key":"14_CR4","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"14_CR7","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. University of California Berkeley, CA (1984)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29(1), 174\u2013200 (1998)","journal-title":"J. Algorithms"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S Khot","year":"2006","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. 36(4), 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009)"},{"issue":"11\u201316","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Comput. Netw. 31(11\u201316), 1481\u20131493 (1999)","journal-title":"Comput. Netw."},{"key":"14_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network datasetcollection (2014). \n                      http:\/\/snap.stanford.edu\/data"},{"key":"14_CR14","unstructured":"Li, Y., Kuboyama, T., Sakamoto, H.: Truss decomposition for extracting communities in bipartite graph. In: IMMM, pp. 76\u201380 (2013)"},{"issue":"5594","key":"14_CR15","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"3","key":"14_CR16","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. Discrete Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"14_CR17","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wang, J., Fu, A.W., Cheng, J.: Rectangle counting in large bipartite graphs. In: BigData, pp. 17\u201324 (2014)","DOI":"10.1109\/BigData.Congress.2014.13"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32049-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:20:08Z","timestamp":1559413208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32049-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320489","9783319320496"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32049-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}