gCol
From MaRDI portal
GCol
swMATH41492MaRDI QIDQ5973471FDOQ5973471
Author name not available (Why is that?)
Official website: https://link.springer.com/content/pdf/bbm%3A978-3-319-25730-3%2F1.pdf
Cited In (42)
- Guide to graph colouring. Algorithms and applications
- Relaxing the assumptions of knockoffs by conditioning
- On Monte Carlo tree search for weighted vertex coloring
- ilsts-wvcp
- Finding happiness: an analysis of the maximum happy vertices problem
- Computing the chromatic number using graph decompositions via matrix rank
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Complexity of fall coloring for restricted graph classes
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- Tackling the maximum happy vertices problem in large networks
- The maximum happy induced subgraph problem: bounds and algorithms
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- An exact algorithm for the partition coloring problem
- Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation
- DESIGN
- jSpin
- race
- ACOTSP
- MeCoSim
- TSpack
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- List edge coloring of outer-1-planar graphs
- FrogCOL
- images
- Rainbowfish
- sgcp-via-cliques
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
- khoca
- A closed formula for the evaluation of foams
- Exact and approximate methods for the score-constrained packing problem
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- An annotated bibliography on 1-planarity
- Capping methods for the automatic configuration of optimization algorithms
- KnockoffGAN
- ACVIZ
- CAPOPT
- HHBQP
- Alternative representations of P systems solutions to the graph colouring problem
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- The small stellated dodecahedron code and friends
This page was built for software: gCol
