[[abstract]]In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of a tree network. The proposed algorithm performs on the EREW PRAM in O(log n log* n) time using O(n) work.[[fileno]]2030218030006[[department]]資訊工程學
This report contains Fork95 implementations of basic parallel operations on trees, like rooting and ...
Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of ...
We present an approach for designing synchronized parallel algorithms to update RedBlack trees. The ...
[[abstract]]In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of ...
[[abstract]]In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally l...
[[abstract]]We propose efficient parallel algorithms on the EREW PRAM for optimally locating in a we...
We present optimal parallel solutions to reporting paths between pairs of nodes in an n-node tree. O...
[[abstract]]Let T = ( V, E ) be a free tree in which each vertex has a weight and each edge has a le...
[[abstract]]An edge is a bisector of a simple path if it contains the middle point of the path. In t...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
[[abstract]]In this paper two cost-optimal parallel algorithms are presented for constructing a B-tr...
A Prüfer code of a labeled free tree with n nodes is a sequence of length n−2 constructed by the fol...
Abstract—A parallel algorithm for prefix computation reported recently on interconnection network ca...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
This report contains Fork95 implementations of basic parallel operations on trees, like rooting and ...
Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of ...
We present an approach for designing synchronized parallel algorithms to update RedBlack trees. The ...
[[abstract]]In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of ...
[[abstract]]In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally l...
[[abstract]]We propose efficient parallel algorithms on the EREW PRAM for optimally locating in a we...
We present optimal parallel solutions to reporting paths between pairs of nodes in an n-node tree. O...
[[abstract]]Let T = ( V, E ) be a free tree in which each vertex has a weight and each edge has a le...
[[abstract]]An edge is a bisector of a simple path if it contains the middle point of the path. In t...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
[[abstract]]In this paper two cost-optimal parallel algorithms are presented for constructing a B-tr...
A Prüfer code of a labeled free tree with n nodes is a sequence of length n−2 constructed by the fol...
Abstract—A parallel algorithm for prefix computation reported recently on interconnection network ca...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
This report contains Fork95 implementations of basic parallel operations on trees, like rooting and ...
Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of ...
We present an approach for designing synchronized parallel algorithms to update RedBlack trees. The ...
DOI
Add to ORKG