Graph Search Problems
Searching graphs for paths, or patterns within them, is a problem with many applications, from planning a good route to finding a certain connection between people. A graph is a set of points that are connected with edges. The points and edges can represent almost anything, such as friendships, roads or connected computers. We research fast algorithms which solve graph problems such as finding the shortest connection between two points, or finding a whole smaller graph inside a larger one (or as much of the smaller one as possible).
Keywords
Algorithms, Mathematics, Artificial Intelligence, Theoretical Computer Science
Staff
Joseph Loughney