<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3374252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2837833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4452109 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A review on algorithms for maximum clique problems / rank | |||
Normal rank | |||
Latest revision as of 20:29, 14 July 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
