Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / N00014-84-C-014
Ph.D. ThesisParallel algorithms have been given for solving a number of graph problems in the litera...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
The authors consider the problem of finding the minimum cost of a feasible flow in directed series-p...
Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are us...
Many problems in program optimization have been solved by applying a technique called interval analy...
Many problems in program optimizationn have been solved by applying a technique called interval anal...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...
There exist at least two models of parallel computing, namely, shared-memory and message-passing. Th...
The study of graph algorithms is an important area of research in computer science, since graphs off...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We study fundamental graph problems under parallel computing models. In particular, we consider two ...
This report records the author’s work during the project’s period. This project will study paral...
Ph.D. ThesisParallel algorithms have been given for solving a number of graph problems in the litera...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
The authors consider the problem of finding the minimum cost of a feasible flow in directed series-p...
Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are us...
Many problems in program optimization have been solved by applying a technique called interval analy...
Many problems in program optimizationn have been solved by applying a technique called interval anal...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...
There exist at least two models of parallel computing, namely, shared-memory and message-passing. Th...
The study of graph algorithms is an important area of research in computer science, since graphs off...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We study fundamental graph problems under parallel computing models. In particular, we consider two ...
This report records the author’s work during the project’s period. This project will study paral...
Ph.D. ThesisParallel algorithms have been given for solving a number of graph problems in the litera...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
The authors consider the problem of finding the minimum cost of a feasible flow in directed series-p...
DOI
Add to ORKG