𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast parallel algorithms for the approximate edge-coloring problem

✍ Scribed by Weifa Liang

Book ID
107766267
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
524 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Algorithms for the Edge-Colorin
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
✍ Weifa Liang; Xiaojun Shen; Qing Hu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ Ο© 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ Ο© 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Υ… 3⌬/2 [16]. A number of parallel algorithms

An NC Parallel Algorithm for Edge-Colori
An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs
✍ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 254 KB

Many combinatorial problems can be efficiently solved in parallel for series᎐parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series᎐parallel multigraphs. This paper gives an NC parallel algorithm for the