You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Use of graph theory to optimize snow removal routes in Montreal and finding an optimal drone flight path to cover all streets in a city. Process of making a graph Eulerian and the use of Edmond-Karp and Bellman-Ford algorithms.
To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation
To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation