Pinned Repositories
diversity-aware-clustering
motif-localized
pace-2018-exact
An experimental software implementation of the Erickson-Monma-Veinott algorithm for solving the Steiner problem in graphs.
restless-reachability
shortest-path
A high-performance implementation of the Dijkstra's algorithm for solving the single-source shortest path problem in graphs with integer edge-weights.
steiner-dreyfus-wagner
A parallel implementation of the Dreyfus-Wagner algorithm for solving the Steiner problem in graphs
steiner-edge-linear
A parallel implementation of the Erickson-Monma-Veinott algorithm for solving the Steiner problem in graphs. It is a parameterised algorithm which runs in edge-linear time and the exponential complexity is restricted to the number of terminals.
temporal-patterns
A parallel implementation of an algebraic framework based on constrained multilinear sieving for finding patterns in temporal graphs.
temporal-patterns-mk2
suhastheju's Repositories
suhastheju/steiner-dreyfus-wagner
A parallel implementation of the Dreyfus-Wagner algorithm for solving the Steiner problem in graphs
suhastheju/temporal-patterns-mk2
suhastheju/diversity-aware-clustering
suhastheju/motif-localized
suhastheju/pace-2018-exact
An experimental software implementation of the Erickson-Monma-Veinott algorithm for solving the Steiner problem in graphs.
suhastheju/temporal-patterns
A parallel implementation of an algebraic framework based on constrained multilinear sieving for finding patterns in temporal graphs.
suhastheju/cosmos
Algorithms that run our universe | Your personal library of every algorithm and data structure code that you will ever encounter | Ask us anything at our forum
suhastheju/restless-reachability
suhastheju/shortest-path
A high-performance implementation of the Dijkstra's algorithm for solving the single-source shortest path problem in graphs with integer edge-weights.
suhastheju/steiner-edge-linear
A parallel implementation of the Erickson-Monma-Veinott algorithm for solving the Steiner problem in graphs. It is a parameterised algorithm which runs in edge-linear time and the exponential complexity is restricted to the number of terminals.
suhastheju/AES128-Gallois-counter-mode
AES Gallois counter mode Implementation
suhastheju/coding-interview-university
A complete computer science study plan to become a software engineer.
suhastheju/colorful-path-1
suhastheju/dhh19
suhastheju/dhh19-sentiment-analysis
suhastheju/diversity-aware-k-median
suhastheju/FairCSS
Code for paper "Fair Column Subset Selection"
suhastheju/frequency-moments
Project for the course Algorithmic Methods of Data Mining at Aalto University
suhastheju/hpctoolkit
HPCToolkit performance tools: measurement and analysis components
suhastheju/reachability
Calculating the forward and backward reachability of temporal networks
suhastheju/server-monitor
A python script to monitor the server status
suhastheju/suhastheju.github.io