We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAlycia Wice
Modified over 4 years ago
-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
-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)
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
CSE 211 Discrete Mathematics
Instructor Neelima Gupta Table of Contents Approximation Algorithms.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
DMOR Networks. Graphs: Koenigsberg bridges Leonard Euler problem (1736)
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
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)
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
Topological Design of Clock Distribution Networks Based on Non-Zero Clock Skew Specification A Class Presentation for VLSI course By: Sareh Mohebali By:
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.
MIT and James Orlin © Introduction to Networks Eulerian Tours Hamiltonian Tours The Shortest Path Problem Dijkstra’s Algorithm for Solving the Shortest.
Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)
Math443/543 Mathematical Modeling and Optimization
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
Utrecht, february 22, 2002 Applications of Tree Decompositions Stan van Hoesel KE-FdEWB Universiteit Maastricht
EAs for Combinatorial Optimization Problems BLG 602E.
Minimum Cost Flow Lecture 5: Jan 25. Problems Recap Bipartite matchings General matchings Maximum flows Stable matchings Shortest paths Minimum spanning.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
A network is shown, with a flow f. v u 6,2 2,2 4,1 5,3 2,1 3,2 5,1 4,1 3,3 Is f a maximum flow? (a) Yes (b) No (c) I have absolutely no idea a b c d.
© 2018 SlidePlayer.com Inc. All rights reserved.