Triangle listing algorithms: back from the diversion

DOI10.1137/1.9781611973198.1MaRDI QIDQ5232483zbMATH OpenOpenAlexFDO

Authors Mark Ortmann, Ulrik Brandes

Publication date 12 September 2019

Published in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL http://nbn-resolving.de/urn:nbn:de:bsz:352-281153

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Listing triangles
• Experimental and Efficient Algorithms
• Arboricity and Subgraph Listing Algorithms
• I/O-efficient algorithms on triangle listing and counting

Cited in

(15)

• iTri: index-based triangle listing in massive graphs
• An efficient exact algorithm for triangle listing in large graphs
• Social centrality using network hierarchy and community structure
• Clique counting in MapReduce: algorithms and experiments
• Why do simple algorithms for triangle enumeration work in the real world?
• Arboricity and Subgraph Listing Algorithms
• I/O-efficient algorithms on triangle listing and counting
• Bounds and algorithms for graph trusses
• Listing triangles
• Experimental and Efficient Algorithms
• Finding small complete subgraphs efficiently
• Tailored vertex ordering for faster triangle listing in large graphs
• Generic network sparsification via degree- and subgraph-based edge sampling
• Maximum core spanning tree maintenance for large dynamic graphs
• Generic network sparsification via hybrid edge sampling

This page was built for publication: Triangle listing algorithms: back from the diversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232483)