scientific article; zbMATH DE number 2226810
From MaRDI portal
Publication:5705147
zbMATH Open1079.68076MaRDI QIDQ5705147FDOQ5705147
Publication date: 8 November 2005
Title of this publication is not available (Why is that?)
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (15)
- Coloring the nodes of a directed graph
- Numerical experiments with LP formulations of the maximum clique problem
- Estimating clique size by coloring the nodes of auxiliary graphs
- Edge coloring of graphs, uses, limitation, complexity
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- Coloring the edges of a directed graph
- Reducing graph coloring to clique search
- Title not available (Why is that?)
- Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- On the greatest number of 2 and 3 colorings of a (v, e)-graph
- A review on algorithms for maximum clique problems
- A clique search problem and its application to machine scheduling
- Exact algorithms for maximum clique: a computational study
Uses Software
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 👍 👎
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)
