Pages that link to "Item:Q4544221"
From MaRDI portal
The following pages link to Iterative coloring extension of a maximum clique (Q4544221):
Displaying 10 items.
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- On the queen graphs coloring problem. (Q817869) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)