iTri: index-based triangle listing in massive graphs

DOI10.1016/j.ins.2015.12.006zbMath1394.68128OpenAlexW2214683327MaRDI QIDQ1671265

Nguyen Anh Tu, Young-Koo Lee, Jinseung Kim, Mostofa Kamal Rasel, Yongkoo Han, Kisung Park

Publication date: 6 September 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.12.006

zbMATH Keywords

graph indexinggraph miningCPU parallelismI/O-efficient algorithmtriangle listing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Information storage and retrieval of data (68P20)

Related Items (1)

Summarized bit batch-based triangle listing in massive graphs

Cites Work

• Short cycle connectivity
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Algorithms and Data Structures for External Memory
• Large Induced Subgraphs via Triangulations and CMSO
• Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures
• Arboricity and Subgraph Listing Algorithms
• Random graph models of social networks
• I/O-Efficient Algorithms on Triangle Listing and Counting
• Listing Triangles
• Collective dynamics of ‘small-world’ networks
• Experimental and Efficient Algorithms
• Unnamed Item

This page was built for publication: iTri: index-based triangle listing in massive graphs