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

Edge-colouring of joins of regular graphs II

โœ Scribed by Caterina De Simone, Anna Galluccio


Book ID
118802002
Publisher
Springer US
Year
2011
Tongue
English
Weight
474 KB
Volume
25
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fast parallel edge colouring of graphs
โœ G. Sajith; S. Saxena ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a รฐD รพ dรž-edge-colouring, 1pdoD; in Oรฐรฐlog d รพ รฐD=dรž 4 รž log 2 nรž time, using n รพ m processors; 2. an algorithm that finds a D 1รพe -edge-colouring, 0oeo1; in Oรฐlog D log รƒ nรž time, using