Skip to content

koodikindral/bsi-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

bsi-algorithm

Finding minimal traversals from hypergraphs

Up to now, the SHD algorithm implemented by Takeaki Uno is a standard de facto algorithm for finding minimal traversal.

The aim of this project is to implement efficient algorithm dedicated to the extraction of the minimal traversal and which beats the SHD algorithm whenever handling large datasets.

The datasets to be considered for performance evaluation are available here.

About

Finding minimal traversal from hypergraphs

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages