A linear time algorithm for maximal clique enumeration in large sparse graphs (Q2628285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6729699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for maximal clique enumeration in large sparse graphs |
scientific article; zbMATH DE number 6729699 |
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
0.837110698223114
0 references
0.8263335824012756
0 references
0.8127668499946594
0 references
0.8065788149833679
0 references
0.7973478436470032
0 references
