Coloring 3/16/121. Flight Gates flights need gates, but times overlap. how many gates needed? 3/16/122.

Slides:

Advertisements

Similar presentations

CSE 211 Discrete Mathematics and Its Applications

Advertisements

CS 336 March 19, 2012 Tandy Warnow.

Great Theoretical Ideas in Computer Science

Great Theoretical Ideas in Computer Science for Some.

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,

Bart Jansen 1.  Problem definition  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least k leaves?

CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.

Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.

Graph Colouring Lecture 20: Nov 25.

Coloring Algorithms and Networks. Coloring2 Graph coloring Vertex coloring: –Function f: V  C, such that for all {v,w}  E: f(v)  f(w) Chromatic number.

Exam Timetabling Problem using Graph Coloring

Graph Theory Ch.5. Coloring of Graphs 1 Chapter 5 Coloring of Graphs.

K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.

K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

Chapter 9.8 Graph Coloring

CS 2813 Discrete Structures

9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.

CS 200 Algorithms and Data Structures

CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.

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

Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.

Vertex Coloring Distributed Algorithms for Multi-Agent Networks

1.Quiz 5 due tomorrow afternoon in E309 from 1pm to 4pm. 2.Homework grades will be based on ten graded homework assignments (dropping the lowest one).

CS6045: Advanced Algorithms NP Completeness. NP-Completeness Some problems are intractable: as they grow large, we are unable to solve them in reasonable.

CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.

Introduction to Graph Theory

Exponential time algorithms Algorithms and networks.

Great Theoretical Ideas in Computer Science for Some.

1 Distributed Vertex Coloring. 2 Vertex Coloring: each vertex is assigned a color.

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.

COMPSCI 102 Introduction to Discrete Mathematics.

CSE 421 Algorithms Richard Anderson Autumn 2015 Lecture 5.

Welcome! Cinda Heeren Lecturer Department of CS UIUC The Beauty of Computer Science.

Graph Coloring: Background and Assignment Networked Life NETS 112 Fall 2014 Prof. Michael Kearns.

Xuding Zhu National Sun Yat-sen University Circular chromatic index.

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

Great Theoretical Ideas In Computer Science

Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]

Graph Coloring Lots of application – be it mapping routes, coloring graphs, building redundant systems, mapping genes, looking at traffic patterns (see.

Proof technique (pigeonhole principle)

Graph Coloring CS 594 Stephen Grady.

What is the next line of the proof?

Graph Theory Graph Colorings.

Chapter 10.8 Graph Coloring

Search Related Algorithms

Discrete Math II Howon Kim

Walks, Paths, and Circuits

Chapter 10.8 Graph Coloring

Chapter 10.8 Graph Coloring

Thue choice number of paths

Richard Anderson Autumn 2016 Lecture 5

Great Theoretical Ideas In Computer Science

Lecture 11 CSE 331 Sep 23, 2011.

Chapter 10.8 Graph Coloring

GRAPHS Lecture 17 CS2110 Spring 2018.

Discrete Mathematics for Computer Science

Richard Anderson Lecture 5 Graph Theory

Prof. Ramin Zabih Graph Traversal Prof. Ramin Zabih

Presentation transcript:

Coloring 3/16/121

Flight Gates flights need gates, but times overlap. how many gates needed? 3/16/122

Airline Schedule Flights time 3/16/123

Conflicts Among 3 Flights Needs gate at same time 3/16/124

Model all Conflicts with a Graph /16/125

Color vertices so that adjacent vertices have different colors. min # distinct colors needed = min # gates needed Color the vertices 3/16/126

Coloring the Vertices 257, , colors 4 gates assign gates: /16/127

Better coloring 3 colors 3 gates /16/128

Final Exams Courses conflict if student takes both, so need different time slots. How short an exam period? 3/16/129

Harvard’s Solution Different “exam group” for every teaching hour. Exams for different groups at different times. 3/16/1210

3/16/1211

But This May be Suboptimal Suppose course A and course B meet at different times If no student in course A is also in course B, then their exams could be simultaneous Maybe exam period can be compressed! (Assuming no simultaneous enrollment) 3/16/1212

Model as a Graph CS 20 Psych 1201 Celtic 101 Music 127r AM 21b M 9am M 2pm T 9am T 2pm 4 time slots (best possible) A B Means A and B have at least one student in common 3/16/1213

Map Coloring 3/16/1214

Planar Four Coloring any planar map is 4-colorable. 1850’s: false proof published ( was correct for 5 colors). 1970’s: proof with computer 1990’s: much improved 3/16/1215

Chromatic Number min #colors for G is chromatic number, χ(G) lemma: χ(tree) = 2 3/16/1216

Pick any vertex as “root.” if (unique) path from root is even length: odd length: Trees are 2-colorable root 3/16/1217

Simple Cycles χ (C even ) = 2 χ (C odd ) = 3 3/16/1218

Bounded Degree all degrees ≤ k, implies very simple algorithm… χ (G) ≤ k+1 3/16/1219

“Greedy” Coloring …color vertices in any order. next vertex gets a color different from its neighbors. ≤ k neighbors, so k+1 colors always work 3/16/1220

coloring arbitrary graphs 2-colorable? --easy to check 3-colorable? --hard to check (even if planar) find χ (G)? --theoretically no harder than 3-color, but harder in practice 3/16/1221

Finis 3/16/1222