Add to ORKGIn this thesis we examine three problems in graph theory and propose efficient parallel algorithms for solving them. We also introduce a number of parallel algorithmic techniques
Abstract: This paper is devoted to parallel algorithms for solving the following prefracta...
The study of graph algorithms is an important area of research in computer science, since graphs off...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensi...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This report records the author’s work during the project’s period. This project will study paral...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Recent advances in the design of efficient parallel algorithms have been largely focusing on the now...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
There exist at least two models of parallel computing, namely, shared-memory and message-passing. Th...
Includes bibliographical references ( leaves 61-64).One way the early use of parallel computers has ...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
[[abstract]]D. I. Moldovan (1982, 1986) has proposed a systematic approach to design parallel algori...
Abstract: This paper is devoted to parallel algorithms for solving the following prefracta...
The study of graph algorithms is an important area of research in computer science, since graphs off...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensi...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This report records the author’s work during the project’s period. This project will study paral...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Recent advances in the design of efficient parallel algorithms have been largely focusing on the now...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
There exist at least two models of parallel computing, namely, shared-memory and message-passing. Th...
Includes bibliographical references ( leaves 61-64).One way the early use of parallel computers has ...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
[[abstract]]D. I. Moldovan (1982, 1986) has proposed a systematic approach to design parallel algori...
Abstract: This paper is devoted to parallel algorithms for solving the following prefracta...
The study of graph algorithms is an important area of research in computer science, since graphs off...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...