The following pages link to (Q4065570):
Displaying 22 items.
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- A better performance guarantee for approximate graph coloring (Q911757) (← links)
- Worst case analysis of a graph coloring algorithm (Q1066156) (← links)
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- The synthesis of communication protocols (Q1098296) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- Worst-case analysis of heuristics for the local microcode optimization problem (Q1119463) (← links)
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- Batch sizes for the batching method of colouring planar maps (Q1153098) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- (Q3879256) (← links)
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- (Q5137498) (← links)
