“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Chapter 7 Graph Theory 7.1 Modeling with graphs and finding Euler circuits. Learning Objectives: Know how to use graphs as models and how to determine.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
AMDM UNIT 7: Networks and Graphs
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
Graphs Intro G.Kamberova, Algorithms Graphs Introduction Gerda Kamberova Department of Computer Science Hofstra University.
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
How is this going to make us 100K Applications of Graph Theory.
Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.
Map Analysis with Networks Francisco Olivera, Ph.D., P.E. Department of Civil Engineering Texas A&M University Some of the figures included in this presentation.
Euler and Hamilton Paths
1 Routing in Error-Correcting Networks Edwin Soedarmadji May 10, 2006 California Institute of Technology Department of Electrical Engineering Pasadena,
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Eulerian Circuits. A Warm Up Problem Jenny & John were at a Math Circles event with three other couples. As people arrived, various handshakes took place.
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
Graph Theory Chapter 6 from Johnsonbaugh Article(6.1, 6.2)
Management Science 461 Lecture 9 – Arc Routing November 18, 2008.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
EECS 203: It’s the end of the class and I feel fine. Graphs.
Graph Theory Topics to be covered:
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Graphs Rosen, Chapter 8. Isomorphism (Rosen 560 to 563) Are two graphs G1 and G2 of equal form? That is, could I rename the vertices of G1 such that the.
Euler and Hamilton Paths
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.
6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
CS 200 Algorithms and Data Structures
Network Optimization Problems
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Topics Paths and Circuits (11.2) A B C D E F G.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Discrete Mathematical Structures: Theory and Applications
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Chapter 6: Graphs 6.1 Euler Circuits
Chapter 5: The Mathematics of Getting Around
Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal.
Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
1 “Graph theory” Course for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Introduction to Graph & Network Theory Thinking About Networks: From Metabolism to the Genome to Social Conflict Summer Workshop for Teachers June 27 th.
EECS 203 Lecture 19 Graphs.
Graph theory. Graph theory Leonard Euler (“Oiler”)
Routing Through Networks - 1
Konigsberg’s Seven Bridges
EECS 203 Lecture 20 More Graphs.
MAT 311 Education for Service-- tutorialrank.com
Can you draw this picture without lifting up your pen/pencil?
Routing and Logistics with TransCAD
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graph Theory.
Genome Assembly.
Nuffield Free-Standing Mathematics Activity
Konigsberg- in days past.
Graph Theory Relations, graphs
Chapter 10 Graphs and Trees
Presentation transcript:

“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor 1

Main topics What graph theory is? How is it applied in geographic information systems? What problems are considered in the course? What are the planning results of education? 2

What graph theory is? Graphs are mathematical structures used to model pairwise relations between objects. Graph G(V,E): V – the set of “vertices" or "nodes“; E – the set of “edges” that connect pairs of nodes. 3

Applications Chemistry (molecular graph)Programming (flow chart) Business (data flow diagram)Engineering (digital circuit) 4

Seven Bridges of Königsberg The problem was to find a walk through the city that would cross each bridge once and only once. Its negative resolution by Leonhard Euler in 1735 laid the foundations of graph theory. The first problem of graph theory is connected with GIS! 5

Graphs in GIS Transportation networks Transportation involves the movement of people and the shipment of goods from one location to another. River networks A hydrologic network usually models a river as a connected set of stream reaches and their confluences. Utility networks Utility networks are the built environment that supplies energy, water, and communications and removes effluent and storm water. 6

Example: ArcGIS («Network Analyst») Main possibilities Finds shortest routes. Produces the most efficient routes for a fleet of vehicles that must visit many locations. Uses time windows to limit when vehicles can arrive at locations. Locates closest facilities. Etc. 7

Example: Q GIS («Road Graph») Main possibilities Calculates path, as well as length and travel time. Optimizes by length or by travel time. Exports path to a vector layer. Highlights roads directions. 8

Problems p-centre and p-median Maximum flow and minimum-cost flow Matching Chinese postman and traveling salesman 9

p-centre and p-median problems (NP-hard) Which ambulances or patrol cars can respond quickest to an incident? What market areas does a business cover? Where can a business open a store to maximize market share? 10

Maximum flow and minimum-cost flow problems How to find a feasible flow through a flow network that is maximum? How to find the cheapest possible way of sending a certain amount of flow through a flow network? 11

Matching problems How to assign customers to a warehouse so as to meet their demands? How to distribute a commodity from a group of supply centers to a group of receiving centers to minimize total cost? 12

Chinese Postman and Traveling Salesman problems (NP-hard) What is the best path and sequence to visit customers? How to find an efficient rout for a garbage truck? 13

Results of education Notion of graph theory applications in GIS Knowledge of graph theory problems and basic algorithms Skills in algorithm developing and estimation of their quality for NP-hard problems Skills in reading of technical literature in English 14

Thank you! Happy to answer your questions. 15