Why do simple algorithms for triangle enumeration work in the real world?

DOI10.1145/2554797.2554819zbMath1365.05273OpenAlexW2153409685MaRDI QIDQ2988883

Jonathan W. Berry, Luke K. Fostvedt, C. Seshadhri, Daniel J. Nordman, Alyson G. Wilson, Cynthia A. Phillips

Publication date: 19 May 2017

Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2554797.2554819

zbMATH Keywords

graph algorithmstriangle enumerationexpected analysisheavy-tailed degree distribution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian ⋮ Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection ⋮ Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? ⋮ Counting triangles in power-law uniform random graphs

Cites Work

• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Trapdoors for hard lattices and new cryptographic constructions
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• Evaluating Branching Programs on Encrypted Data
• Bounds for Width Two Branching Programs
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• New lattice-based cryptographic constructions
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography