Summarized bit batch-based triangle listing in massive graphs

DOI10.1016/J.INS.2018.02.018MaRDI QIDQ2195476zbMATH OpenOpenAlexFDO

Authors Mostofa Kamal Rasel, En Elena, Young-Koo Lee

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

zbMATH Keywords

bitmap compressionCPU parallelismtriangle listing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient exact algorithm for triangle listing in large graphs
• iTri: index-based triangle listing in massive graphs
• Experimental and Efficient Algorithms
• Counting triangles in massive graphs with MapReduce
• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• A second look at counting triangles in graph streams

Cites work

• An efficient exact algorithm for triangle listing in large graphs
• Approximate string matching with compressed indexes
• Arboricity and Subgraph Listing Algorithms
• Collective dynamics of `small-world' networks
• Experimental and Efficient Algorithms
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• I/O-efficient algorithms on triangle listing and counting
• Large Induced Subgraphs via Triangulations and CMSO
• Listing triangles
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Random graph models of social networks
• Set-based approximate approach for lossless graph summarization
• Short cycle connectivity
• iTri: index-based triangle listing in massive graphs

Cited in

(2)

• An efficient exact algorithm for triangle listing in large graphs
• iTri: index-based triangle listing in massive graphs

This page was built for publication: Summarized bit batch-based triangle listing in massive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195476)