✦ LIBER ✦

Parallel Algorithms for the Circuit Value Update Problem

✍ Scribed by C. E. Leiserson; K. H. Randall

Publisher: Springer
Year: 1997
Tongue: English
Weight: 189 KB
Volume: 30
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for boundary value p

Parallel algorithms for boundary value problems

✍ Avi Lin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Parallel algorithms for initial value pr

Parallel algorithms for initial value problems: Parallel shooting

✍ B.M.S Khalaf; D Hutchinson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

Step-parallel algorithms for stiff initi

Step-parallel algorithms for stiff initial value problems

✍ W.A. van der Veen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1022 KB

Parallel initial-value algorithms for si

Parallel initial-value algorithms for singularly perturbed boundary-value problems

✍ M. G. Gasparo; M. Macconi 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 902 KB

Parallel Algorithms for the Edge-Colorin

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

✍ Weifa Liang; Xiaojun Shen; Qing Hu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ ϩ 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ ϩ 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Յ 3⌬/2 [16]. A number of parallel algorithms

A parallel chopping algorithm for ODE bo

A parallel chopping algorithm for ODE boundary value problems

✍ Marcin Paprzycki; Ian Gladwell 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 729 KB