Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
DOI10.1080/15427951.2015.1037030zbMath1461.68143arXiv1407.1116OpenAlexW2275335637WikidataQ57435497 ScholiaQ57435497MaRDI QIDQ4985805
Luke A. Fostvedt, Daniel J. Nordman, C. Seshadhri, Jonathan W. Berry, Alyson G. Wilson, Cynthia A. Phillips
Publication date: 26 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1116
Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- Generating simple random graphs with prescribed degree distribution
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- The asymptotic connectivity of labelled regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Planar orientations with low out-degree and compaction of adjacency matrices
- The asymptotic number of labeled graphs with given degree sequences
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Eigenvalues of random power law graphs
- A Random Graph Model for Power Law Graphs
- Why do simple algorithms for triangle enumeration work in the real world?
- Emergence of Scaling in Random Networks
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Structure and Function of Complex Networks
- A critical point for random graphs with a given degree sequence
- Collective dynamics of ‘small-world’ networks
- The average distances in random graphs with given expected degrees
- Experimental and Efficient Algorithms
- METHOD OF MOMENTS AND METHOD OF MAXIMUM LIKELIHOOD
This page was built for publication: Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
