scientific article; zbMATH DE number 2226810
From MaRDI portal
Publication:5705147
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)
Recommendations
- A fast algorithm for the maximum clique problem
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- An exact bit-parallel algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- An improved branch and bound algorithm for the maximum clique problem
Cited in
(15)- Exact algorithms for maximum clique: a computational study
- Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)
- A clique search problem and its application to machine scheduling
- Numerical experiments with LP formulations of the maximum clique problem
- Estimating clique size by coloring the nodes of auxiliary graphs
- Coloring the edges of a directed graph
- Edge coloring of graphs, uses, limitation, complexity
- A review on algorithms for maximum clique problems
- Reducing graph coloring to clique search
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- On the greatest number of 2 and 3 colorings of a (v, e)-graph
- Coloring the nodes of a directed graph
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705147)
