The following pages link to (Q4247451):
Displaying 26 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- A coloring fuzzy graph approach for image classification (Q854950) (← links)
- The graph coloring problem: A neuronal network approach (Q930943) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm (Q1417848) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- The robust coloring problem. (Q1812001) (← links)
- On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Mining market data: a network approach (Q2499151) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
- Spectral bounds for the quantum chromatic number of quantum graphs (Q6173925) (← links)
- Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677) (← links)
