✦ LIBER ✦

Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

✍ Scribed by Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Chen, Gen-Huey

Book ID: 118197206
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 356 KB
Volume: 15
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480101389880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel strategy for the p

An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

✍ Sun-Yuan Hsieh 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 444 KB

An efficient parallel strategy for the t

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

✍ Sun-Yuan Hsieh 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 749 KB

A Faster Implementation of a Parallel Tr

A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs

✍ Sun-yuan Hsieh; Chin-Wen Ho; Tsan-sheng Hsu; Ming-Tat Ko; Gen-Huey Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 261 KB

We consider a parallel tree contraction scheme which in each contraction phase Ž . Ž . removes leaves and nodes in the maximal chains. Let T n and P n denote the time and processor complexity required to compute the all nearest smaller values Ž . ANSV and the minimum of n values for input elements d