{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:39:54Z","timestamp":1762868394616,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030660451"},{"type":"electronic","value":"9783030660468"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-66046-8_15","type":"book-chapter","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T15:02:32Z","timestamp":1609686152000},"page":"179-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using Large Cliques for Hierarchical Dense Subgraph Discovery"],"prefix":"10.1007","author":[{"given":"Md Moniruzzaman","family":"Monir","sequence":"first","affiliation":[]},{"given":"Ahmet Erdem","family":"Sar\u0131y\u00fcce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"15_CR1","unstructured":"Alvarez-Hamelin, J.I., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS, pp. 41\u201350 (2006)"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Angel, A., Koudas, N., Sarkas, N., Srivastava, D., Svendsen, M., Tirthapura, S.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 1\u201325 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0340-z","DOI":"10.1007\/s00778-013-0340-z"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","DOI":"10.1126\/science.286.5439.509"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"SP Borgatti","year":"2000","unstructured":"Borgatti, S.P., Everett, M.G.: Models of core\/periphery structures. Soc. Netw. 21(4), 375\u2013395 (2000)","journal-title":"Soc. Netw."},{"key":"15_CR5","unstructured":"Clauset, A., Tucker, E., Sainz, M.: The colorado index of complex networks (2016). https:\/\/icon.colorado.edu"},{"key":"15_CR6","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Technical report, National Security Agency Technical Report, Fort Meade, MD (2008)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW, pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Du, X., Jin, R., Ding, L., Lee, V.E., Jr., J.H.T.: Migration motif: a spatial-temporal pattern mining approach for financial markets. In: SIGKDD, pp. 1135\u20131144 (2009)","DOI":"10.1145\/1557019.1557142"},{"issue":"1\u20132","key":"15_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of graphs and set-systems. Acta Math. Hung. 17(1\u20132), 61\u201399 (1966)","journal-title":"Acta Math. Hung."},{"issue":"14","key":"15_CR10","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B., Brutlag, D., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"key":"15_CR11","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: VLDB, pp. 721\u2013732 (2005)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Gleich, D.F., Seshadhri, C.: Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: SIGKDD, pp. 597\u2013605 (2012)","DOI":"10.1145\/2339530.2339628"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri, C.: A fast and provable method for estimating clique counts using tur\u00e1n\u2019s theorem. In: WWW, pp. 441\u2013449 (2017)","DOI":"10.1145\/3038912.3052636"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. In: WWW, pp. 1481\u20131493 (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"15_CR16","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: k-degenerate graphs. Can. J.Math. 22(5), 1082\u20131096 (1970)","journal-title":"Can. J.Math."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23"},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: efficiently counting all 5-vertex subgraphs. In: WWW, pp. 1431\u20131440 (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, pp. 4292\u20134293 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Saito, K., Yamada, T.: Extracting communities from complex networks by the k-dense method. In: IEEE ICDM Workshops, pp. 300\u2013304 (2006)","DOI":"10.1109\/ICDMW.2006.76"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Seshadhri, C., P\u0131nar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: WWW, pp. 927\u2013937 (2015)","DOI":"10.1145\/2736277.2741640"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3057742","volume":"11","author":"AE Sar\u0131y\u00fcce","year":"2017","unstructured":"Sar\u0131y\u00fcce, A.E., Seshadhri, C., P\u0131nar, A., \u00c7ataly\u00fcrek, \u00dc.: Nucleus decompositions for identifying hierarchy of dense subgraphs. ACM Trans. Web 11(3), 1\u201327 (2017)","journal-title":"ACM Trans. Web"},{"issue":"3","key":"15_CR26","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Netw. 5(3), 269\u2013287 (1983)","journal-title":"Social Netw."},{"issue":"16","key":"15_CR27","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud, A.L., Mucha, P.J., Porter, M.A.: Social structure of facebook networks. Phys. A 391(16), 4165\u20134180 (2012)","journal-title":"Phys. A"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: International Conference on World Wide Web, WWW, pp. 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"15_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1090\/conm\/588\/11702","volume":"588","author":"A Verma","year":"2013","unstructured":"Verma, A., Butenko, S.: Network clustering via clique relaxations: A community based. Graph Partitioning and Graph Clustering 588, 129 (2013)","journal-title":"Graph Partitioning and Graph Clustering"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: IEEE ICDE, pp. 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, F., Tung, A.: Large scale cohesive subgraphs discovery for social network visual analysis. In: PVLDB, pp. 85\u201396 (2013)","DOI":"10.14778\/2535568.2448942"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66046-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T03:48:26Z","timestamp":1748836106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66046-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030660451","9783030660468"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66046-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}