✦ LIBER ✦

Efficient parallel algorithms for edge coloring problems

✍ Scribed by Howard J Karloff; David B Shmoys

Book ID: 103628210
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 876 KB
Volume: 8
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90026-5

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

Fast parallel algorithms for the approxi

Fast parallel algorithms for the approximate edge-coloring problem

✍ Weifa Liang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 524 KB

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

Efficient parallel and sequential algori

Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs

✍ Xin He 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 816 KB

Parallel I/O scheduling using randomized

Parallel I/O scheduling using randomized, distributed edge coloring algorithms

✍ Dannie Durand; Ravi Jain; David Tseytlin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 403 KB

A Linear Algorithm for Edge-Coloring Ser

A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs

✍ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Many combinatorial problems can be efficiently solved for series᎐parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obta