๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Worst case analysis of a graph coloring algorithm

โœ Scribed by Jeremy P. Spinrad; Gopalakrishnan Vijayan

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
164 KB
Volume
12
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Worst case analysis of a greedy algorith
Worst case analysis of a greedy algorithm for graph thickness
โœ Sinichiro Kawano; Koichi Yamazaki ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio

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