Maximum clique exhaustive search in circulant k-hypergraphs

DOI10.1007/978-3-030-25005-8_31MaRDI QIDQ2301758zbMATH OpenOpenAlexFDO

Authors Lachlan Plant, Lucia Moura

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_31

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• A new algorithm for the maximum clique problem
• The maximum clique problem
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• On comparing algorithms for the maximum clique problem
• Finding maximum cliques on circular-arc graphs

Cited in

(1)

• Finding graphs with exponential clique-growth using genetic algorithms

This page was built for publication: Maximum clique exhaustive search in circulant \(k\)-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301758)