Pages that link to "Item:Q4597964"
From MaRDI portal
The following pages link to <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964):
Displaying 6 items.
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
- Extension of a clique cover result to uniform hypergraphs (Q1078579) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- (Q3218170) (← links)
- A post-quantum associative memory (Q6063372) (← links)
- Covering array on the Cartesian product of hypergraphs (Q6581902) (← links)