Presentation is loading. Please wait.

Presentation is loading. Please wait.

Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,

Published byAlycia Wice Modified over 9 years ago

Similar presentations

Presentation on theme: "Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,"— Presentation transcript:

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

Download ppt "Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,"

Similar presentations

CSE 211 Discrete Mathematics

CSE 211 Discrete Mathematics
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
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)
Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.

Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.
Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)

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

Math443/543 Mathematical Modeling and Optimization
EAs for Combinatorial Optimization Problems BLG 602E.

EAs for Combinatorial Optimization Problems BLG 602E.
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.

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.

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.
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Fall 2014 Doug James Lecture 17: Graphs.

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Fall 2014 Doug James Lecture 17: Graphs.
Package Transportation Scheduling Albert Lee Robert Z. Lee.

Package Transportation Scheduling Albert Lee Robert Z. Lee.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.

Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,

Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology 2010-20111Tran Van Hoai.

Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology 2010-20111Tran Van Hoai.

Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Miao Zhao, Ming Ma and Yuanyuan Yang

Miao Zhao, Ming Ma and Yuanyuan Yang
Modeling and Evaluation with Graph Mohammad Khalily Dermany Islamic Azad University, Khomein branch.

Modeling and Evaluation with Graph Mohammad Khalily Dermany Islamic Azad University, Khomein branch.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.

“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Similar presentations

Ads by Google