scientific article
From MaRDI portal
Publication:4065570
zbMath0308.05109MaRDI QIDQ4065570
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)
Related Items (22)
A graph coloring algorithm for large scale scheduling problems ⋮ The synthesis of communication protocols ⋮ On the complexity of H-coloring ⋮ The smallest hard-to-color graph for the SL algorithm ⋮ Worst-case analysis of heuristics for the local microcode optimization problem ⋮ Sequential coloring versus Welsh-Powell bound ⋮ Unnamed Item ⋮ Complexity of dimension three and some related edge-covering characteristics of graphs ⋮ Batch sizes for the batching method of colouring planar maps ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ A better performance guarantee for approximate graph coloring ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ The smallest hard-to-color graph ⋮ Greed is good: Approximating independent sets in sparse and bounded-degree graphs ⋮ A still better performance guarantee for approximate graph coloring ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ The allocation problem in hardware design ⋮ On approximation problems related to the independent set and vertex cover problems ⋮ Unnamed Item ⋮ Optimal approximation of sparse hessians and its equivalence to a graph coloring problem ⋮ Worst case analysis of a graph coloring algorithm ⋮ Numerical experiences with graph coloring algorithms
This page was built for publication:
