hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
From MaRDI portal
Publication:4597964
DOI10.1142/S1793830917500781zbMATH Open1386.05127MaRDI QIDQ4597964FDOQ4597964
Authors: Jose Torres-Jimenez, Jose Carlos Perez-Torres, Gildardo Maldonado-Martinez 
Publication date: 14 December 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
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
- An improved branch and bound algorithm for the maximum clique problem
- Reducibility among combinatorial problems
- A fast algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- Title not available (Why is that?)
- Software and hardware testing using combinatorial covering suites
Cited In (7)
- A post-quantum associative memory
- Covering array on the Cartesian product of hypergraphs
- Title not available (Why is that?)
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
- Title not available (Why is that?)
- Extension of a clique cover result to uniform hypergraphs
- Reducing hypergraph coloring to clique search
Uses Software
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)
