Speaker: Dr. Bhargavi B. (Alumni)

Affiliation: Assistant Professor, GITAM Deemed to be University, Hyderabad
Date: 26th Sept
Time: 3pm
Venue: New Seminar Room
Title: Finding Multidimensional Constraint Reachable Paths for Attributed Graphs

Abstract:
A graph acts as a powerful modelling tool to represent complex relationships between objects in the big data era. 
Given two vertices, vertex and edge constraints, the multidimensional constraint reachable ( MCR) paths problem 
finds the path between the given vertices that match the user-specified constraints. A significant challenge is 
to store the graph topology and attribute information while constructing a reachability index. This talk introduces 
attributed graphs and their applications. The talk explores various graph clustering techniques for attributed graphs. 
The talk explores existing techniques in finding multidimensional constraint reachable paths in case of attributed graphs.