From Coloring Maps to Avoiding Conflicts Nathaniel Dean, Robert M. Nehs, and Tong Wu Department of Mathematical Sciences Texas Southern University 3100.

Slides:



Advertisements
Similar presentations
Great Theoretical Ideas in Computer Science for Some.
Advertisements

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
The Four Color Theorem (4CT)
David Laughon CS594 Graph Theory Graph Coloring. Coloring – Assignment of labels to vertices k-coloring – a coloring where Proper k-coloring – k-coloring.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
Applied Combinatorics, 4th Ed. Alan Tucker
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.
Graph Colouring Lecture 20: Nov 25.
Coloring Graphs This handout: Coloring maps and graphs
Exam Timetabling Problem using Graph Coloring
Graph Theory Ch.5. Coloring of Graphs 1 Chapter 5 Coloring of Graphs.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graph Theory and Graph Coloring Lindsay Mullen
Graph Coloring.
Chapter 9.8 Graph Coloring
CS 2813 Discrete Structures
Coloring 3/16/121. Flight Gates flights need gates, but times overlap. how many gates needed? 3/16/122.
9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.
Graph Coloring.
Let G be a pseudograph with vertex set V, edge set E, and incidence mapping f. Let n be a positive integer. A path of length n between vertex v and vertex.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Modeling Using Colorability Presented by: Kelley Louie CSC 252 Algorithms 252a-aj.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 33.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
1 Graph Coloring: An Overview Graph Coloring Basics Planar/4-color Graphs Applications New Register Allocation Technique.
Aim: What does map coloring have to do with Graph theory?
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Planar Graphs Graph Coloring
Chapter 10.8 Graph Coloring
CSE, IIT KGP Graph Coloring. CSE, IIT KGP K-coloring A k-coloring of G is a labeling f:V(G)  {1,…,k}.A k-coloring of G is a labeling f:V(G)  {1,…,k}.
Graph.
Unit – V Graph theory. Representation of Graphs Graph G (V, E,  ) V Set of vertices ESet of edges  Function that assigns vertices {v, w} to each edge.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Graph Theory and Applications
Planar Graphs Lecture 10: Oct 21. This Lecture Today we will talk about planar graphs, and how to color a map using 6 colors. Planar graphs Euler’s formula.
Introduction to Graph Theory
Graph Theory Ming-Jer Tsai. Outline Graph Graph Theory Grades Q & A.
Great Theoretical Ideas in Computer Science for Some.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
Chapter 10.8 Graph Coloring These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7 th ed., by Kenneth.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Planarity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT.
FOUR COLOR THEOREM BY: JUSTIN GILMORE. FOUR COLOR THEOREM The four-color theorem states that any map in a plane can be colored using four-colors in such.
A problem with train tracks and interval graphs PRESENTED BY MANVITHA NELLORE.
Map Coloring Vertex Drawing Txt: mini excursion 2 (p ) & SOL: DM.1 Classwork Project Assigned due in two blocks (print the rubric at the end of.
Presented By Ravindra Babu, Pentyala.  Real World Problem  What is Coloring  Planar Graphs  Vertex Coloring  Edge Coloring  NP Hard Problem  Problem.
Timetable Problem solving using Graph Coloring
Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]
Discrete Mathematics Graph: Planar Graph Yuan Luo
Graph Coloring.
Graph Coloring Lots of application – be it mapping routes, coloring graphs, building redundant systems, mapping genes, looking at traffic patterns (see.
Great Theoretical Ideas In Computer Science
5.9.2 Characterizations of Planar Graphs
Applied Combinatorics, 4th Ed. Alan Tucker
ICS 353: Design and Analysis of Algorithms
Graph Theory Graph Colorings.
Chapter 10.8 Graph Coloring
Coloring Graphs This handout: Coloring maps and graphs
Discrete Math II Howon Kim
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
Applied Combinatorics, 4th Ed. Alan Tucker
Graph Coloring.
Chapter 10.8 Graph Coloring
Discrete Mathematics for Computer Science
Prof. Ramin Zabih Graph Traversal Prof. Ramin Zabih
Presentation transcript:

From Coloring Maps to Avoiding Conflicts Nathaniel Dean, Robert M. Nehs, and Tong Wu Department of Mathematical Sciences Texas Southern University 3100 Cleburne Avenue Houston, TX 77004

Map Coloring Countries with a common boundary must have different colors. countries regions faces ocean infinite face

Four Color Problem 1852 letter by Augustus de Morgan to Sir William Hamilton: Four colors are required. Do 4 colors suffice? 1976: Appel and Haken proved it using an intricate case analysis on a computer

Exercise: Draw a map that requires four colors.

3-Coloring Maps Computer Science project by Malvika Rao (student), McGill U.

The Dual is a Planar Graph.

Graph G=(V,E) consists of a set V of objects called vertices and a set E of unordered pairs of vertices. vertex node point edge link line

Vertex Coloring A k-coloring is a labeling f:V(G)  {1,2,…,k}. A k-coloring is proper if xy  E(G) implies f(x)  f(y). G is k-colorable if it has a proper k-coloring. The chromatic number  (G) is the smallest k such that G is k-colorable  (G) = 4

Exercise: Prove  (Moser Graph) = 4.

Party Problem People P 1, P 2, …, P n meet for a party, but certain pairs are incompatible. Goal: Assign people to rooms so that no two people in the same room are incompatible. How many rooms are needed?

Solution to the Party Problem V(G) = {P 1, P 2, …, P n }. P i, P j  E(G) iff P i and P j are incompatible. The chromatic number  (G) is the least number of rooms. Construct a conflict graph G  (G) = 4

Scheduling Problem Five different groups of students {1,2,3}, {6,7}, {1,7,9}, {4,6,8}, {2,3,4} must take exams in the following engineering courses S 1, S 2, S 3, S 4, S 5, respectively. Goal: Schedule the exams using a minimum number of time periods.

Solution to the Scheduling Problem V(G) = {S 1, S 2, S 3, S 4, S 5 }. S i, S j  E(G) iff S i  S j  . The chromatic number  (G) is the minimum number of time periods. Construct a conflict graph G. {1,2,3} {4,6,8} {2,3,4} {6,7} {1,7,9}  (G) = 3

Future Work Allow student to enter any arbitrary map or (nonplanar) graph. Add a map library, and allow transferring between map and corresponding graph. Develop algorithms with student. Explore applications.

Thanks! Directors: Lang Moore David Smith Frank Wattenberg Funding Agencies MAA Andrew Frank Lang David