<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: hClique: An exact algorithm for maximum clique problem in uniform hypergraphs |
scientific article; zbMATH DE number 6818820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.92157334
0 references
0 references
0.91569054
0 references
0.90844023
0 references
0.9034976
0 references
0.90141726
0 references
