Main-memory triangle computations for very large (sparse (power-law)) graphs
From MaRDI portal
(Redirected from Publication:955020)
Recommendations
Cites work
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 6469213 (Why is no real title available?)
- Algorithms – ESA 2004
- Approximating Clustering Coefficient and Transitivity
- Arboricity and Subgraph Listing Algorithms
- Codes for the World Wide Web
- Collective dynamics of `small-world' networks
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Computing and Combinatorics
- Coupling Scale-Free and Classical Random Graphs
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- Every monotone graph property is testable
- Experimental and Efficient Algorithms
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Introduction to algorithms
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Matrix measures for transitivity and balance*
- Matrix multiplication via arithmetic progressions
- Network analysis. Methodological foundations.
- Radix Sorting with No Extra Space
- Statistical mechanics of complex networks
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
- iTri: index-based triangle listing in massive graphs
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Efficient computation of the Weighted Clustering Coefficient
- Finding dense subgraphs with maximum weighted triangle density
- Finding weighted k-truss communities in large networks
- Why do simple algorithms for triangle enumeration work in the real world?
- On linear algebraic algorithms for the subgraph matching problem and its variants
- 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
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)
