An efficient exact algorithm for triangle listing in large graphs
type: Item
instance of: scholarly article
title: An efficient exact algorithm for triangle listing in large graphs
zbMATH Open document ID: 1411.68086
author: Sofiane Lagraa
author: Hamida Seba
published in: Data Mining and Knowledge Discovery
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7050595
zbMATH Keywords: triangle listing
zbMATH Keywords: large graphs
zbMATH Keywords: graph compression
describes a project that uses: SNAP
describes a project that uses: STRING
describes a project that uses: DOULION
describes a project that uses: WebGraph
MaRDI profile type: Publication
full work available at URL: s10618-016-0451-4
OpenAlex ID: W2269681615
cites work: Fast algorithms for determining (generalized) core groups in social networks
cites work: Listing Triangles
cites work: Q4331190
cites work: Arboricity and Subgraph Listing Algorithms
cites work: Q5678892
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: Transitiv orientierbare Graphen
cites work: Algorithm Theory - SWAT 2004
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Finding a Minimum Circuit in a Graph
cites work: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
cites work: A distance measure for large graphs based on prime graphs
cites work: Main-memory triangle computations for very large (sparse (power-law)) graphs
cites work: Q4506382
cites work: Q3683903
cites work: Triangle Listing Algorithms: Back from the Diversion
cites work: Experimental and Efficient Algorithms
DOI: 10.1007/S10618-016-0451-4
Recommended article: Experimental and Efficient Algorithms
Recommended article: An efficient algorithm for enumeration of triangulations
Recommended article: Summarized bit batch-based triangle listing in massive graphs
Recommended article: iTri: index-based triangle listing in massive graphs
Recommended article: Q5422563
Recommended article: Efficient triangle counting in large graphs via degree-based vertex partitioning
Recommended article: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
Recommended article: Efficiently enumerating minimal triangulations
Recommended article: I/O-Efficient Algorithms on Triangle Listing and Counting
Recommended article: Q3798682
description: scientific article; zbMATH DE number 7050595