A linear time algorithm for maximal clique enumeration in large sparse graphs (Q2628285)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for maximal clique enumeration in large sparse graphs |
scientific article |
Statements
A linear time algorithm for maximal clique enumeration in large sparse graphs (English)
0 references
13 June 2017
0 references
graph algorithms
0 references
maximal clique enumeration
0 references
data structures
0 references
computational complexity
0 references
linear time algorithms
0 references
0 references
0 references
