✦ LIBER ✦

Efficiently parallelizable problems on a class of decomposable graphs

✍ Scribed by Sun-Yuan Hsieh

Book ID: 108166482
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 289 KB
Volume: 70
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.08.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of Efficiently Parallel

Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

✍ Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Chen, Gen-Huey 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 356 KB

On the Problem of Decomposing a Graph in

On the Problem of Decomposing a Graph into n Connected Factors

✍ Tutte, W. T. 📂 Article 📅 1961 🏛 Oxford University Press 🌐 English ⚖ 269 KB

A class of multicriterial problems on gr

A class of multicriterial problems on graphs and hypergraphs

✍ V. A. Perepelitsa 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 647 KB

On a class of degenerate extremal graph

On a class of degenerate extremal graph problems

✍ Ralph J. Faudree; Miklós Simonovits 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 507 KB

Generation of polynomial-time algorithms

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

✍ R. B. Borie 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 837 KB

Solving Problems on Special Classes of G

Solving Problems on Special Classes of Graphs

✍ Vijay Raghavan; Jeremy P. Spinrad 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 210 KB