Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (Q3060751): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1567562836 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:21, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time |
scientific article |
Statements
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (English)
0 references
9 December 2010
0 references
sparse graphs
0 references
\(d\)-degenerate graphs
0 references
maximal clique listing algorithms
0 references
Bron-Kerbosch algorithm
0 references
fixed-parameter tractability
0 references
