{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:34:55Z","timestamp":1729654495712,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/icde.2012.35","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T21:38:33Z","timestamp":1341956313000},"page":"1049-1060","source":"Crossref","is-referenced-by-count":96,"title":["Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks"],"prefix":"10.1109","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402011"},{"journal-title":"Extracting Analyzing and Visualizing Triangle K-Core Motifs Within Networks","year":"2011","author":"zhang","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367590"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1145\/1321440.1321580","article-title":"A dual-view approach to interactive network visualization","author":"namata","year":"2007","journal-title":"ACM CIKM"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1631162.1631164"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281266"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_51"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150506"},{"journal-title":"CoRR","article-title":"An O(m) Algorithm for Cores Decomposition of Networks","year":"2003","author":"batagelj","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376663"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"journal-title":"ICDE","article-title":"CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases","year":"2006","author":"wang","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557101"},{"key":"5","article-title":"On Spectral Clustering: Analysis and an algorithm","volume":"14","author":"ng","year":"2001","journal-title":"Advances in neural information processing systems"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"9"},{"journal-title":"ACM SIGKDD","article-title":"A Fast Kernelbased Multilevel Algorithm for Graph Clustering","year":"2005","author":"dhillon","key":"8"}],"event":{"name":"2012 IEEE International Conference on Data Engineering (ICDE 2012)","start":{"date-parts":[[2012,4,1]]},"location":"Arlington, VA, USA","end":{"date-parts":[[2012,4,5]]}},"container-title":["2012 IEEE 28th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6226952\/6228063\/06228155.pdf?arnumber=6228155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T21:11:21Z","timestamp":1497993081000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6228155\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icde.2012.35","relation":{},"subject":[],"published":{"date-parts":[[2012,4]]}}}