<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MaxCliqueDyn / rank | |||
Normal rank | |||
Revision as of 07:49, 28 February 2024
scientific article; zbMATH DE number 6818820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs |
scientific article; zbMATH DE number 6818820 |
Statements
<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (English)
0 references
14 December 2017
0 references
uniform hypergraphs
0 references
maximum clique problem
0 references
