The following pages link to (Q3035310):
Displaying 22 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- The mean chromatic number of paths and cycles (Q687131) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- Welsh-Powell opposition graphs (Q1115450) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- On the mean chromatic number (Q1322240) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Improving graph colouring algorithms and heuristics using a novel representation (Q1742608) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
- Graph colouring algorithms (Q2822600) (← links)
- Graph Coloring Using GPUs (Q3297570) (← links)
- Greedy defining sets in graphs and Latin squares (Q3439453) (← links)
- Heuristics versus completeness in graph coloring (Q4484664) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5706004) (← links)
