The following pages link to (Q5670645):
Displaying 36 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms (Q543817) (← links)
- A multiobjective framework for heavily constrained examination timetabling problems (Q613763) (← links)
- The clique-partitioning problem (Q807637) (← links)
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- Expose-and-merge exploration and the chromatic number of a random graph (Q1104942) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- Approximation algorithms for combinatorial problems (Q1213733) (← links)
- Some applications of graph theory to clustering (Q1222008) (← links)
- A note on the complexity of the chromatic number problem (Q1229753) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Mixed graph colorings (Q1360876) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- CIPFAR: a 3D unified numerical framework for the modeling of ductile fracture based on the phase field model and adaptive remeshing (Q2246404) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- (Q3879256) (← links)
- Compactness and balancing in scheduling (Q4145144) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- Bounded color functions on graphs (Q5650701) (← links)
- On the chromatic number of graphs (Q5942344) (← links)
- Transformations for maximal planar graphs with minimum degree five (Q6085725) (← links)
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring (Q6579767) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
