Download presentation

Presentation is loading. Please wait.

Published byAlycia Wice Modified over 4 years ago

1
Graph

2
-traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE, TRAVELLING SALESMAN PROBLEM CHINESE POSTMAN PROBLEM Network Modeling (rail, road, airline) Applications

3
-circuit layout, VLSI GRAPH DRAWING PLANARITY -communication protocols DIAMETER, RADIUS SPANNING TREE DOMINATING SET -fault-tolerant networks MINIMUM CUT CONNECTIVITY Applications Network Modeling (electrical, communication)

4
Applications -Job scheduling / Critical path GRAPH COLOURING MAXIMUM CLIQUE -Job Assignment MAXIMUM MATCHING STABLE MARRIAGE PROBLEM -Evolutionary trees (Biology) TREE DECOMPOSITION Modeling conflict / compatibility / relationship

Similar presentations

OK

9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)

9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google