Algorithm 457: finding all cliques of an undirected graph (Q5677064): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56210395, #quickstatements; #temporary_batch_1704602819833 |
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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/362342.362367 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2116007667 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:04, 20 March 2024
scientific article; zbMATH DE number 3412166
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm 457: finding all cliques of an undirected graph |
scientific article; zbMATH DE number 3412166 |
Statements
Algorithm 457: finding all cliques of an undirected graph (English)
0 references
1973
0 references
