𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel variant of a heuristical algorithm for graph coloring — Corrigendum

✍ Scribed by Janez Žerovnik; Matjaž Kaufman

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
213 KB
Volume
18
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with