✦ LIBER ✦

Computing downwards accumulations on trees quickly

✍ Scribed by Jeremy Gibbons

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 939 KB
Volume: 169
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00114-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on computing the similarity of

Comments on computing the similarity of binary trees

✍ J.P. Jarvis; J.K. Luedeman; D.R. Shier 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Computation on binary tree-networks

✍ Maurice Tchuente 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Effect of sewage irrigation on yield, tr

Effect of sewage irrigation on yield, tree components and heavy metals accumulation in navel orange trees

✍ M.S. Omran; T.M. Waly; E.M. Abd Elnaim; B.M.B. El Nashar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 401 KB

On limits on the computational power of

On limits on the computational power of data-accumulating algorithms

✍ Stefan D Bruda; Selim G Akl 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are processed before another datum arrives. Previous research states that a constant upper bound on the running time of a successful algorithm within this par

On computing a longest path in a tree

✍ R.W. Bulterman; F.W. van der Sommen; G. Zwaan; T. Verhoeff; A.J.M. van Gasteren; 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 37 KB

An optimal EREW parallel algorithm for c

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

✍ H.S. Chao; F.R. Hsu; R.C.T. Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM