hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
From MaRDI portal
Publication:4597964
Recommendations
- CliSAT: a new exact algorithm for hard maximum clique problems
- An exact algorithm for the maximum clique problem
- Exact algorithms for maximum clique: a computational study
- An exact algorithm for the maximum quasi‐clique problem
- An exact algorithm for the maximum probabilistic clique problem
- scientific article; zbMATH DE number 1424217
- A new exact maximum clique algorithm for large and massive sparse graphs
- scientific article; zbMATH DE number 2226810
- The maximum independent union of cliques problem: complexity and exact approaches
Cites work
- scientific article; zbMATH DE number 2040957 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Reducibility among combinatorial problems
- Software and hardware testing using combinatorial covering suites
Cited in
(7)- Extension of a clique cover result to uniform hypergraphs
- Covering array on the Cartesian product of hypergraphs
- Reducing hypergraph coloring to clique search
- A post-quantum associative memory
- scientific article; zbMATH DE number 2096442 (Why is no real title available?)
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
- scientific article; zbMATH DE number 3884215 (Why is no real title available?)
This page was built for publication: hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597964)
