The following pages link to gCol (Q5973471):
Displayed 26 items.
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
- On Monte Carlo tree search for weighted vertex coloring (Q2163775) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Relaxing the assumptions of knockoffs by conditioning (Q2215771) (← links)
- A closed formula for the evaluation of foams (Q2224467) (← links)
- Alternative representations of P systems solutions to the graph colouring problem (Q2299885) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- The small stellated dodecahedron code and friends (Q4561770) (← links)
- (Q4965840) (← links)
- Guide to Graph Colouring (Q5007093) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)