The following pages link to (Q5705147):
Displaying 11 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes (Q3627689) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)
