hClique: An exact algorithm for maximum clique problem in uniform hypergraphs

DOI10.1142/S1793830917500781MaRDI QIDQ4597964zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1142/S1793830917500781

zbMATH Keywords

maximum clique problemuniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

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

• 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
• scientific article; zbMATH DE number 2040957 (Why is no real title available?)
• Reducibility among combinatorial problems
• Software and hardware testing using combinatorial covering suites

Cited in

(9)

• Extension of a clique cover result to uniform hypergraphs
• Reducing hypergraph coloring to clique search
• scientific article; zbMATH DE number 3884215 (Why is no real title available?)
• scientific article; zbMATH DE number 2096442 (Why is no real title available?)
• A post-quantum associative memory
• Covering array on the Cartesian product of hypergraphs
• On the size of integer programs with bounded non-vanishing subdeterminants
• An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs

Describes a project that uses

Uses Software

• MaxCliqueDyn

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)