𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph endpoint coloring and distributed processing

✍ Scribed by D. De Werra; P. Hell; T. Kameda; N. Katoh; Ph. Solot; M. Yamashita

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
460 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Asymmetric graph coloring games
Asymmetric graph coloring games
✍ H. A. Kierstead πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

Parallel and On-Line Graph Coloring
Parallel and On-Line Graph Coloring
✍ Magnus M HalldΓ³rsson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 209 KB

We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We present a randomized on-line Ε½ . coloring algorithm with a performance ratio of O nrlog n , an improvement of log n factor over the previous best known algorithm of Vishwanathan

Scalable parallel graph coloring algorit
Scalable parallel graph coloring algorithms
✍ Gebremedhin, Assefaw Hadish ;Manne, Fredrik πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 1 views
An edge coloring problem for graph produ
An edge coloring problem for graph products
✍ Faudree, R. J.; GyοΏ½rfοΏ½s, AndrοΏ½as; Schelp, R. H. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H