Summarized bit batch-based triangle listing in massive graphs
From MaRDI portal
Publication:2195476
DOI10.1016/j.ins.2018.02.018zbMath1440.68193OpenAlexW2790395341MaRDI QIDQ2195476
En Elena, Young-Koo Lee, Mostofa Kamal Rasel
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.02.018
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Short cycle connectivity
- Set-based approximate approach for lossless graph summarization
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Approximate string matching with compressed indexes
- iTri: index-based triangle listing in massive graphs
- An efficient exact algorithm for triangle listing in large graphs
- 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
This page was built for publication: Summarized bit batch-based triangle listing in massive graphs
