Skip to content

Compute Transitive Closure of a directed Graph in Parallel

Notifications You must be signed in to change notification settings

aravindkanna/BTP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

BTP

Compute Transitive Closure of a directed Graph in Parallel

This project is being done in various phases following a famous research paper of J.D.Ullman. Currently working on the implementations of the basis and recursive rules.

About

Compute Transitive Closure of a directed Graph in Parallel

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published