Triangle Listing Algorithms: Back from the Diversion

DOI10.1137/1.9781611973198.1zbMath1430.68232OpenAlexW808058772MaRDI QIDQ5232483

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

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

Related Items (5)

Finding small complete subgraphs efficiently ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ Social centrality using network hierarchy and community structure ⋮ Parameterized aspects of triangle enumeration ⋮ Clique Counting in MapReduce

This page was built for publication: Triangle Listing Algorithms: Back from the Diversion