𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal parallel 3-coloring algorithm for rooted trees and its applications

✍ Scribed by Peter Rajčáni

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
358 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Parallel Algorithms for Optima
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

pNJTree: A parallel program for reconstr
pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW
✍ Zhihua Du; Feng Lin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Neighbor-joining (NJ) is a distance-based method for tree construction. It is the most widely used method with polynomial time complexity at present. However, a fundamental problem with the previous implementations of this method is its limitation to handle large taxa sets within a reasonable time a

Electropolymerization kinetic study of 3
Electropolymerization kinetic study of 3,3-dimethyl-3,4-dihydro-2H-thieno[3,4-b][1,4]dioxepine and its optical optimization for electrochromic window applications
✍ Sooyeun Kim; Minoru Taya 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Poly (3,3-dimethyl-3,4-dihydro-2H-thieno[3,4-b][1,4]dioxepine), PProDOT-Me 2 , is one of the most promising conducting polymers in the alkylenedioxythiophene based family for electrochromic window applications. In the electropolymerization kinetic study of 3,3-dimethyl-3,4-dihydro-2H-thieno[3,4b][1,