✦ LIBER ✦

Scalable parallel graph coloring algorithms

✍ Scribed by Gebremedhin, Assefaw Hadish ;Manne, Fredrik

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 143 KB
Volume: 12
Category: Article
ISSN: 1040-3108
DOI: 10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for coloring semi-random grap

Algorithms for coloring semi-random graphs

✍ C. R. Subramanian; Martin Fürer; C. E. Veni Madhavan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB 👁 2 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

Parallel unstructured tetrahedral mesh a

Parallel unstructured tetrahedral mesh adaptation: algorithms, implementation and scalability

✍ Selwood, P. M.; Berzins, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

The use of unstructured adaptive tetrahedral meshes in the solution of transient flows poses a challenge for parallel computing due to the irregular and frequently changing nature of the data and its distribution. A parallel mesh adaptation algorithm, PTETRAD, for unstructured tetrahedral meshes (ba