Pages that link to "Item:Q2489282"
From MaRDI portal
The following pages link to An exact method for graph coloring (Q2489282):
Displaying 12 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- An exact graph coloring algorithm using color exchange (Q1374088) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← 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)