scientific article; zbMATH DE number 3404264
From MaRDI portal
Publication:5670645
Cited in
(37)- Numerical experiences with graph coloring algorithms
- A graph coloring algorithm for large scale scheduling problems
- Expose-and-merge exploration and the chromatic number of a random graph
- Chromatic optimisation: Limitations, objectives, uses, references
- Heuristic for rapidly four-coloring large planar graphs
- COSINE: A new graph coloring algorithm
- The smallest hard-to-color graph
- Approximation algorithms for combinatorial problems
- Some applications of graph theory to clustering
- A note on the complexity of the chromatic number problem
- Hard-to-color graphs for connected sequential colorings
- The smallest hard-to-color graph for the SL algorithm
- Mixed graph colorings
- Treewidth for graphs with small chordality
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- CIPFAR: a 3D unified numerical framework for the modeling of ductile fracture based on the phase field model and adaptive remeshing
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Simple decentralized graph coloring
- Improvements to MCS algorithm for the maximum clique problem
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- Graph Coloring Using Eigenvalue Decomposition
- Estimation of sparse hessian matrices and graph coloring problems
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- Average-case complexity of backtrack search for coloring sparse random graphs
- Compactness and balancing in scheduling
- Complexity of coloring random graphs: an experimental study of the hardest region
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Bounded color functions on graphs
- On the chromatic number of graphs
- Transformations for maximal planar graphs with minimum degree five
- A multiobjective framework for heavily constrained examination timetabling problems
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- Clique number estimate based on coloring of the nodes
- The clique-partitioning 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 Q5670645)
