Listing Triangles

DOI10.1007/978-3-662-43948-7_19zbMath1410.05191OpenAlexW4214508572WikidataQ60299131 ScholiaQ60299131MaRDI QIDQ5167744

Uri Zwick, Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Density (toughness, etc.) (05C42)

Related Items (20)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ On triangle estimation using tripartite independent set queries ⋮ Dynamic Set Intersection ⋮ It's all a matter of degree. Using degree information to optimize multiway joins ⋮ iTri: index-based triangle listing in massive graphs ⋮ Mind the gap! ⋮ Approximately Counting Triangles in Sublinear Time ⋮ Summarized bit batch-based triangle listing in massive graphs ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ Finding small complete subgraphs efficiently ⋮ Bounds and algorithms for graph trusses ⋮ Online recognition of dictionary with one gap ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ Parameterized aspects of triangle enumeration ⋮ Clique Counting in MapReduce ⋮ 3SUM, 3XOR, triangles ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

This page was built for publication: Listing Triangles