𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cosine: A new graph coloring algorithm

✍ Scribed by A. Hertz

Book ID
107918204
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
377 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Simple Competitive Graph Coloring Algo
A Simple Competitive Graph Coloring Algorithm
✍ H.A. Kierstead πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu

Load balancing by graph coloring, an alg
Load balancing by graph coloring, an algorithm
✍ R. Jeurissen; W. Layton πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 560 KB

Motivated by an application to load balancing in data-parallel finite element methods, we consider the following coloring question. Color an arbitrary, edge-to-edge triangulation T of a planar domain with two colors so that the largest connected group of same color triangles is as small as possible.

A New Algorithm for On-line Coloring Bip
A New Algorithm for On-line Coloring Bipartite Graphs
✍ Broersma, Hajo J.; Capponi, Agostino; Paulusma, DaniΓ«l πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 271 KB