Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...

Depending on the underlying graph, you also need to handle cycles intelligently. In social networks, mutual relationships are ...

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

Here are 11 free NPTEL data science and analytics courses from leading IITs cover graph theory, Bayesian modelling, Python, R ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.