MCA 520: Graph Theory Instructor Neelima Gupta

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

MCA 202: Discrete Mathematics Instructor Neelima Gupta
Instructor Neelima Gupta Table of Contents Approximation Algorithms.
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.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
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.
Introduction This chapter explores graphs and their applications in computer science This chapter explores graphs and their applications in computer science.
Euler Circuits and Paths
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
Graphs Intro G.Kamberova, Algorithms Graphs Introduction Gerda Kamberova Department of Computer Science Hofstra University.
Mapping Networks Or, the costs and benefits of abstraction.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
CSE 321 Discrete Structures Winter 2008 Lecture 25 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.
MCA 520: Graph Theory Instructor Neelima Gupta
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graphs and Euler cycles Let Maths take you Further…
9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.
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.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
Can you find a way to cross every bridge only once?
GRAPH Learning Outcomes Students should be able to:
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
MCS 312: NP Completeness and Approximation algorithms Instructor Neelima Gupta
Ch. 15: Graph Theory Some practical uses Degree of separation- Hollywood, acquaintance, collaboration Travel between cities Konigsberg bridge Shortest.
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.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
It's a world-wide webby wonderland.. Graphs are often used to represent real-world information and real-world structures. Graph Theory was even invented.
CS 200 Algorithms and Data Structures
Connected Components Fun with graphs, searching, and queues.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Graphs Topic 21 " Hopefully, you've played around a bit with The Oracle of Bacon at Virginia and discovered how few steps are necessary to link just about.
Data Structures & Algorithms Graphs
MCA 202: Discrete Structures Instructor Neelima Gupta
Graphs, Paths & Circuits
Aim: What is an Euler Path and Circuit?
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
Instructor Neelima Gupta Table of Contents Five representative problems.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
MCS 312: NP Completeness and Approximation algorthms Instructor Neelima Gupta
The Seven Bridges of Konigsberg (circa 1735) In Konigsberg, Germany, a river ran through the city such that in its centre was an island, and after passing.
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
1 Algorithms and networks Period 3, 2011/ Today Graphs and networks and algorithms: what and why? This course: organization Case introduction:
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Graph Theory Graph Theory - History Leonhard Euler's paper on “Seven Bridges of Königsberg”, published in 1736.
Instructor Neelima Gupta Table of Contents Introduction to Approximation Algorithms Factor 2 approximation algorithm for TSP Factor.
Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 1 – Slide Graph Theory Graphs, Paths & Circuits.
MCA 520: Graph Theory Instructor Neelima Gupta
Graph Coloring.
Graph theory. Graph theory Leonard Euler (“Oiler”)
BIPARTITE GRAPHS AND ITS APPLICATIONS
Chapter 5 Fundamental Concept
Graph theory Definitions Trees, cycles, directed graphs.
Agenda Lecture Content: Introduction to Graph Path and Cycle
Color These Maps with Four Colors
هجرة الشباب الدولية والتنمية الفرص والتحديات
GRAPH-THEORY AND APPLICATIONS
Graph Theory What is a graph?.
Representing Graphs Wade Trappe.
Graphs, Paths & Circuits
CHAPTER 15 Graph Theory.
Ch. 9: Graph Theory 9.1 Intro to Graphs.
Presentation transcript:

MCA 520: Graph Theory Instructor Neelima Gupta

Table of Contents Introduction

Origin of Graph Theory Konigsberg Bridge Problem: City of Konigsberg was located on the Pregel river in Prussia. The city occupied the islands of Kneiphopf and the areas of both the banks of the river. Regions linked by 7 bridges. Citizens want to start from home and come back traversing each bridge exactly once.

Models Acquaintance Relations: Invite for a dinner so that everybody knows everybody else Clique Conflict Relations: Invite for a dinner so that there is no conflict amongst the people. Independent Set Job Assignments Bipartite Matching Scheduling Committees in rooms Graph Coloring

Models Contd… Maps Coloring Coloring Road Networks/ Communication Networks MST and TSP

Matrices: Graph Representation Adjacency Matrices Incidence Matrices