A guide to graph colouring. Algorithms and applications
From MaRDI portal
Recommendations
Cited in
(33)- Finding happiness: an analysis of the maximum happy vertices problem
- The maximum happy induced subgraph problem: bounds and algorithms
- On Monte Carlo tree search for weighted vertex coloring
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- Relaxing the assumptions of knockoffs by conditioning
- A closed formula for the evaluation of foams
- Efficient multigrid solution of elliptic interface problems using viscosity-upwinded local discontinuous Galerkin methods
- Alternative representations of P systems solutions to the graph colouring problem
- An annotated bibliography on 1-planarity
- Capping methods for the automatic configuration of optimization algorithms
- Graph colouring algorithms
- The small stellated dodecahedron code and friends
- Graph Colorings
- Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation
- Guide to graph colouring. Algorithms and applications
- scientific article; zbMATH DE number 7625170 (Why is no real title available?)
- Hierarchical and modularly-minimal vertex colorings
- Properties of large 2-crossing-critical graphs
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem
- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- Heuristic algorithms for graph set coloring problem
- Highly Scalable Bayesian Geostatistical Modeling via Meshed Gaussian Processes on Partitioned Domains
- gCol
- An index for sequencing reads based on the colored de Bruijn graph
- Graph coloring methods
- The connection between the chromatic numbers of a hypergraph and its 1-intersection graph
- Algebraic and combinatorial algorithms for S-packing coloring
- A set packing model for the partition coloring problem
- Edge coloring lattice graphs
- Embeddings to rectilinear space and Gromov-Hausdorff distances
- Maximum strength of connectedness in Ramsey complete fuzzy graphs with Ramsey fuzzy clique and its application
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
This page was built for publication: A guide to graph colouring. Algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450578)
