4 papers
Dynamic Breadth First Search with Predictions
Shahbaz Khan, Shubham Kumar Verma, Utkarsh Lohiya
Given a graph having vertices and edges, we maintain its Breadth-First Search (BFS) tree from source under an online sequence of edge updates in the prediction…
Practical algorithms for Hierarchical overlap graphs
Saumya Talera, Parth Bansal, Shabnam Khan +1
Genome assembly is a prominent problem studied in bioinformatics, which computes the source string using a set of its overlapping substrings. Classically, genome assembly uses asse…
Evaluating Optimal Safe Flows Decomposition for RNA Assembly
Bashar Ahmed, Siddharth Singh Rana, Ujjwal +1
In Bioinformatics, the applications of flow decomposition in directed acyclic graphs are highlighted in RNA Assembly problem. However, it admits multiple solutions where exactly on…
Engineering Semi-streaming DFS algorithms
Kancharla Nikhilesh Bhagavan, Macharla Sri Vardhan, Madamanchi Ashok Chowdary +1
Depth first search is a fundamental graph problem having a wide range of applications. For a graph having vertices and edges, the DFS tree can be computed in $O(m…