{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T16:54:18Z","timestamp":1758905658405},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10618-016-0451-4","type":"journal-article","created":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T07:58:58Z","timestamp":1453881538000},"page":"1350-1369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An efficient exact algorithm for triangle listing in large graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Sofiane","family":"Lagraa","sequence":"first","affiliation":[]},{"given":"Hamida","family":"Seba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,27]]},"reference":[{"issue":"2","key":"451_CR1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaversnik MZ (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5(2):129\u2013145","journal-title":"Adv Data Anal Classif"},{"issue":"3","key":"451_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2010) Efficient algorithms for large-scale local triangle counting. ACM Trans Knowl Discov Data 4(3):13:1\u201313:28. doi: 10.1145\/1839490.1839494","journal-title":"ACM Trans Knowl Discov Data"},{"key":"451_CR3","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund A, Pagh R, Williams V, Zwick U (2014) Listing triangles. In: Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E (eds) Automata, languages, and programming. Lecture notes in computer science. Springer, Berlin, pp 223\u2013234. doi: 10.1007\/978-3-662-43948-7_19","DOI":"10.1007\/978-3-662-43948-7_19"},{"key":"451_CR4","doi-asserted-by":"publisher","unstructured":"Boldi P, Vigna S (2004) The webgraph framework i: Compression techniques. In: Proceedings of the 13th international conference on world wide web, WWW \u201904, pp 595\u2013602. ACM, New York doi: 10.1145\/988672.988752","DOI":"10.1145\/988672.988752"},{"key":"451_CR5","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14:S13","journal-title":"BMC Bioinform"},{"issue":"1","key":"451_CR6","first-page":"55","volume":"5","author":"C Capelle","year":"2002","unstructured":"Capelle C, Habib M, de Montgolfier F (2002) Graph decompositions and factorizing permutations. Discret Math Theor Comput Sci 5(1):55\u201370","journal-title":"Discret Math Theor Comput Sci"},{"issue":"1","key":"451_CR7","doi-asserted-by":"publisher","first-page":"742","DOI":"10.14778\/1687627.1687711","volume":"2","author":"C Chen","year":"2009","unstructured":"Chen C, Lin CX, Fredrikson M, Christodorescu M, Yan X, Han J (2009) Mining graph patterns efficiently via randomized summaries. Proc VLDB Endow 2(1):742\u2013753. doi: 10.14778\/1687627.1687711","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"451_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210\u2013223. doi: 10.1137\/0214017","journal-title":"SIAM J Comput"},{"issue":"4","key":"451_CR9","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2382577.2382581","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu S, Cheng J (2012) Triangle listing in massive networks. ACM Trans Knowl Discov Data 6(4):17:1\u201317:32. doi: 10.1145\/2382577.2382581","journal-title":"ACM Trans Knowl Discov Data"},{"key":"451_CR10","unstructured":"Cowan D, James I, Stanton R (1972) Graph decomposition for undirected graphs. In: 3rd S-E conference on combinatorics, graph theory and computing, pp 281\u2013290"},{"key":"451_CR11","doi-asserted-by":"publisher","unstructured":"Dahlhaus E, Gustedt J, McConnell RM (2001) Efficient and practical algorithms for sequential modular decomposition. J Algorithms 41(2):360\u2013387. doi: 10.1006\/jagm.2001.1185 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S019667740191185X","DOI":"10.1006\/jagm.2001.1185"},{"key":"451_CR12","unstructured":"Dementiev R (2006) Algorithm engineering for large data sets hardware, software, algorithms. Ph.D. thesis, Saarland University, Saarbrucken"},{"key":"451_CR13","unstructured":"de\u00a0Montgolfier F (2003) Modular decomposition of graphs: theory, extensions and algorithms. Ph.D. thesis, Universit\u00e9 des Sciences et Techniques du Languedoc, Montpellier"},{"key":"451_CR14","doi-asserted-by":"publisher","unstructured":"Fan W, Li J, Wang X, Wu Y (2012) Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, SIGMOD \u201912, pp 157\u2013168. ACM, New York. doi: 10.1145\/2213836.2213855","DOI":"10.1145\/2213836.2213855"},{"key":"451_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai T (1967) Transitiv orientierbare graphen. Acta Math Hung 18:25\u201366","journal-title":"Acta Math Hung"},{"key":"451_CR16","doi-asserted-by":"crossref","unstructured":"Habib M, de\u00a0Montgolfier F, Paul C (2004) A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Proceedings of the algorithm theory\u2014SWAT 2004, 9th Scandinavian workshop on algorithm theory, Humlebaek, Denmark, 8\u201310 July 2004, pp 187\u2013198","DOI":"10.1007\/978-3-540-27810-8_17"},{"issue":"1","key":"451_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib M, Paul C (2010) A survey of the algorithmic aspects of modular decomposition. Comput Sci Rev 4(1):41\u201359","journal-title":"Comput Sci Rev"},{"issue":"2","key":"451_CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M Habib","year":"1999","unstructured":"Habib M, Paul C, Viennot L (1999) Partition refinement techniques: an interesting algorithmic tool kit. Int J Found Comput Sci 10(2):147\u2013170","journal-title":"Int J Found Comput Sci"},{"key":"451_CR19","doi-asserted-by":"publisher","unstructured":"Hu X, Tao Y, Chung CW (2013) Massive graph triangulation. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD \u201913, pp 325\u2013336. ACM, New York. doi: 10.1145\/2463676.2463704","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"451_CR20","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai A, Rodeh M (1978) Finding a minimum circuit in a graph. SIAM J Comput 7(4):413\u2013423","journal-title":"SIAM J Comput"},{"key":"451_CR21","doi-asserted-by":"publisher","unstructured":"Kolountzakis MN, Miller G, Peng R, Tsourakakis CE (2010) Efficient triangle counting in large graphs via degree-based vertex partitioning. In: Kumar R, Sivakumar D (eds) Algorithms and models for the web-graph. Lecture notes in computer science. Springer, Berlin, pp 15\u201324. doi: 10.1007\/978-3-642-18009-5_3","DOI":"10.1007\/978-3-642-18009-5_3"},{"issue":"9","key":"451_CR22","doi-asserted-by":"crossref","first-page":"2993","DOI":"10.1016\/j.patcog.2014.03.014","volume":"47","author":"S Lagraa","year":"2014","unstructured":"Lagraa S, Seba H, Khennoufa R, M\u2019Baya A, Kheddouci H (2014) A distance measure for large graphs based on prime graphs. Pattern Recognit 47(9):2993\u20133005","journal-title":"Pattern Recognit"},{"issue":"1\u20133","key":"451_CR23","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1\u20133):458\u2013473","journal-title":"Theor Comput Sci"},{"key":"451_CR24","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"451_CR25","unstructured":"Mcconnell RM, Spinrad JP (2000) Ordered vertex partitioning. Discret Math Theor Comput Sci 4(1). http:\/\/dmtcs.episciences.org\/274"},{"key":"451_CR26","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R M\u00f6hring","year":"1985","unstructured":"M\u00f6hring R (1985) Algorithmic aspect of the substitution decomposition in optimization over relation, set system and boolean function. Ann Oper Res 4:195\u2013225","journal-title":"Ann Oper Res"},{"key":"451_CR27","first-page":"257","volume":"19","author":"R M\u00f6hring","year":"1984","unstructured":"M\u00f6hring R, Radermacher F (1984) Substitution decomposition and connection with combinatorial optimization. Ann Discret Math 19:257\u2013356","journal-title":"Ann Discret Math"},{"key":"451_CR28","doi-asserted-by":"crossref","unstructured":"Ortmann M, Brandes U (2014) Triangle listing algorithms: Back from the diversion. In: 2014 proceedings of the sixteenth workshop on algorithm engineering and experiments, ALENEX 2014, Portland, Oregon, USA, 5 Jan 2014, pp 1\u20138","DOI":"10.1137\/1.9781611973198.1"},{"key":"451_CR29","unstructured":"Schank T (2007) Algorithmic aspects of triangle-based network analysis. Ph.D. thesis, Universit\u00e4t Karlsruhe, Karlsruhe"},{"key":"451_CR30","doi-asserted-by":"publisher","unstructured":"Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In: Proceedings of the 4th International conference on experimental and efficient algorithms, WEA\u201905, pp 606\u2013609. Springer-Verlag, Berlin, Heidelberg. doi: 10.1007\/11427186_54","DOI":"10.1007\/11427186_54"},{"key":"451_CR31","doi-asserted-by":"crossref","first-page":"D561","DOI":"10.1093\/nar\/gkq973","volume":"39","author":"D Szklarczyk","year":"2011","unstructured":"Szklarczyk D, Franceschini A, Kuhn M, Simonovic M, Roth A, Minguez P, Doerks T, Stark M, Muller J, Bork P, Jensen L, Mering CV (2011) The string database in 2011: functional interaction networks of proteins, globally integrated and scored. Nucleic Acids Res 39:D561\u2013D568","journal-title":"Nucleic Acids Res"},{"key":"451_CR32","doi-asserted-by":"publisher","unstructured":"Tedder M, Corneil D, Habib M, Paul C (2008) Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto L, Damgrd I, Goldberg L, Halldrsson M, Inglfsdttir A, Walukiewicz I (eds) Automata, languages and programming. Lecture notes in computer science. Springer, Berlin, pp 634\u2013645. doi: 10.1007\/978-3-540-70575-8_52","DOI":"10.1007\/978-3-540-70575-8_52"},{"key":"451_CR33","doi-asserted-by":"publisher","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) Doulion: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201909, pp 837\u2013846. ACM, New York. doi: 10.1145\/1557019.1557111","DOI":"10.1145\/1557019.1557111"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-016-0451-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-016-0451-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-016-0451-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:47Z","timestamp":1559244587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-016-0451-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,27]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s10618-016-0451-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,27]]}}}