Main-memory triangle computations for very large (sparse (power-law)) graphs
From MaRDI portal
Publication:955020
DOI10.1016/J.TCS.2008.07.017zbMATH Open1152.68045OpenAlexW2016311778MaRDI QIDQ955020FDOQ955020
Authors: Matthieu Latapy 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.017
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Cites Work
- Statistical mechanics of complex networks
- Introduction to algorithms
- Collective dynamics of `small-world' networks
- Finding and counting given length cycles
- Matrix multiplication via arithmetic progressions
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Codes for the World Wide Web
- Network analysis. Methodological foundations.
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- Approximating Clustering Coefficient and Transitivity
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Title not available (Why is that?)
- Coupling Scale-Free and Classical Random Graphs
- Algorithms – ESA 2004
- Every monotone graph property is testable
- Experimental and Efficient Algorithms
- Radix Sorting with No Extra Space
- Matrix measures for transitivity and balance*
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
Cited In (25)
- Analyzing the maritime transportation system in Greece: a complex network approach
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Efficient Computation of the Weighted Clustering Coefficient
- Experimental and Efficient Algorithms
- An efficient exact algorithm for triangle listing in large graphs
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Summarized bit batch-based triangle listing in massive graphs
- Parallel Discovery of Top-k Weighted Motifs in Large Graphs
- Getting linear time in graphs of bounded neighborhood diversity
- Listing triangles
- Complex networks and link streams for the empirical analysis of large software
- Leave or not leave? Group members' departure prediction in dynamic information networks
- Efficient computation of the Weighted Clustering Coefficient
- iTri: index-based triangle listing in massive graphs
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Finding dense subgraphs with maximum weighted triangle density
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Why do simple algorithms for triangle enumeration work in the real world?
- Finding weighted \(k\)-truss communities in large networks
- I/O-efficient algorithms on triangle listing and counting
- Complex network filtering and compression algorithm based on triangle-subgraph
- Counting triangles in massive graphs with MapReduce
- Scalable approximate Bayesian computation for growing network models via extrapolated and sampled summaries
- Tailored vertex ordering for faster triangle listing in large graphs
Uses Software
This page was built for publication: Main-memory triangle computations for very large (sparse (power-law)) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955020)
