Breadth-First Search (BFS) and Depth-First Search (DFS) are two fundamental algorithms used in computer science and data analysis to traverse and search data structures like graphs and trees. These ...

Abstract: Graph-structured data arise ubiquitously in many application domains. A fundamental problem is to quantify their similarities. Graph kernels are often used for this purpose, which decompose ...

Abstract: Given a graph G={V, E} and a distinguished source vertex `s', the traditional BFS algorithm systematically explores the edges of G to discover every vertex that is reachable from the source ...

This repository contains code for our SPAA paper "Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable" (SPAA'18). It includes implementations of the following parallel graph ...

Proteinortho is a widely used tool to predict (co)-orthologous groups of genes for any set of species. It finds application in comparative and functional genomics, phylogenomics, and evolutionary ...

Georgia Tech's online master's in computer science has taken off like a rocket ship. It is the most successful degree program in the history of higher education and we should all take important ...