Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Dec. 15 th, Presentation for Final Project.

Slides:



Advertisements
Similar presentations
Theory of Computing Lecture 18 MAS 714 Hartmut Klauck.
Advertisements

1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
The Theory of NP-Completeness
1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 
David Laughon CS594 Graph Theory Graph Coloring. Coloring – Assignment of labels to vertices k-coloring – a coloring where Proper k-coloring – k-coloring.
Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009.
PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Computability and Complexity 15-1 Computability and Complexity Andrei Bulatov NP-Completeness.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Definition of complexity class NP –Nondeterministic computation –Problems.
Reduction Techniques Restriction Local Replacement Component Design Examples.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
NP-Complete Problems Problems in Computer Science are classified into
NP-complete and NP-hard problems
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 23 Instructor: Paul Beame.
Semidefinite Programming Based Approximation Algorithms Uri Zwick Uri Zwick Tel Aviv University UKCRC’02, Warwick University, May 3, 2002.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 24 Instructor: Paul Beame.
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
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.
Black-box (oracle) Feed me a weighted graph G and I will tell you the weight of the max-weight matching of G.
Clique Cover Cook’s Theorem 3SAT and Independent Set
1 The Theory of NP-Completeness 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP? X = P.
CSCE350 Algorithms and Data Structure
Computational Complexity Polynomial time O(n k ) input size n, k constant Tractable problems solvable in polynomial time(Opposite Intractable) Ex: sorting,
Applications of types of SATs Arash Ahadi What is SAT?
1 The Theory of NP-Completeness 2012/11/6 P: the class of problems which can be solved by a deterministic polynomial algorithm. NP : the class of decision.
CSEP 521 Applied Algorithms Richard Anderson Lecture 10 NP Completeness.
INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.
Oriented Coloring: Complexity and Approximation
Approximation Algorithms
CSE 024: Design & Analysis of Algorithms Chapter 9: NP Completeness Sedgewick Chp:40 David Luebke’s Course Notes / University of Virginia, Computer Science.
EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.
Techniques for Proving NP-Completeness Show that a special case of the problem you are interested in is NP- complete. For example: The problem of finding.
1 The Theory of NP-Completeness 2 Cook ’ s Theorem (1971) Prof. Cook Toronto U. Receiving Turing Award (1982) Discussing difficult problems: worst case.
Semidefinite Programming
Unit 9: Coping with NP-Completeness
NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.
Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.
The Evolution of a Hard Graph Theory Problem – Secure Sets Ron Dutton Computer Science University of Central Florida 1.
CS 3343: Analysis of Algorithms Lecture 25: P and NP Some slides courtesy of Carola Wenk.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
CSE 6311 – Spring 2009 ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS Lecture Notes – Feb. 3, 2009 Instructor: Dr. Gautam Das notes by Walter Wilson.
NP Completeness Piyush Kumar. Today Reductions Proving Lower Bounds revisited Decision and Optimization Problems SAT and 3-SAT P Vs NP Dealing with NP-Complete.
1 Complexities of some interesting problems on spanning trees M Sohel Rahman King’s College, London M Kaykobad KHU, NSU and BUET.
Young CS 331 D&A of Algo. NP-Completeness1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and.
CSCI 2670 Introduction to Theory of Computing December 2, 2004.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
CSE 421 Algorithms Richard Anderson Lecture 29 Complexity Theory NP-Complete P.
Given this 3-SAT problem: (x1 or x2 or x3) AND (¬x1 or ¬x2 or ¬x2) AND (¬x3 or ¬x1 or x2) 1. Draw the graph that you would use if you want to solve this.
1 1. Which of these sequences correspond to Hamilton cycles in the graph? (a) (b) (c) (d) (e)
1 The Theory of NP-Completeness 2 Review: Finding lower bound by problem transformation Problem X reduces to problem Y (X  Y ) iff X can be solved by.
CSE 332: NP Completeness, Part II Richard Anderson Spring 2016.
Presented By Ravindra Babu, Pentyala.  Real World Problem  What is Coloring  Planar Graphs  Vertex Coloring  Edge Coloring  NP Hard Problem  Problem.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
P & NP.
Chapter 10 NP-Complete Problems.
Richard Anderson Lecture 26 NP-Completeness
COMPLEXITY THEORY IN PRACTICE
Richard Anderson Lecture 26 NP-Completeness
Hard Problems Introduction to NP
What is the next line of the proof?
CS21 Decidability and Tractability
ICS 353: Design and Analysis of Algorithms
Richard Anderson Lecture 25 NP-Completeness
The Power of Preprocessing: Gems in Kernelization
1. for (i=0; i < n; i+=2) if (A[i] > A[i+1]) swap(A[i], A[i+1])
NP-Complete Problems.
CSE 589 Applied Algorithms Spring 1999
Complexity Theory in Practice
Lecture 23 NP-Hard Problems
Presentation transcript:

Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Dec. 15 th, Presentation for Final Project

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5] DFS, BFS

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Graph-3-colorability In NP: verify a coloring in O(|E|+|V|), BFS or DFS Reduction from 3-SAT: An instance of 3-SAT with literals U={u j } and clauses C={Ci}; Consider the following transformation to graph G so that there exists a satisfying truth assignment for all {C i } i.f.f. there is a proper 3-coloring {0, 1, 2}: 1)3-colorable; 2)Output = 0, when all inputs are 0; 0, 1 or 2, o.w. 1)Assign -> coloring; 2)Coloring -> assign

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Graph-3-colorability ∆≤4 (G 3 *) In NP: verify a coloring in O(|E|+|V|), BFS or DFS Reduction from graph-3-colorability(G 3 ): An instance of graph G 3 ; Consider the following transformation to graph G 3 * so that there exists a proper 3-coloring for G 3 i.f.f. there is a proper 3-coloring for G 3 *:  For any u in G 3 with degree k > 4, substitute it with H k  H k <- H k-1 + H 3 0) 3-colorable 1)All the k outlet vertices must share the same colors 2)Coloring to G 3 Coloring to G 3 * H3H3 HkHk

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Introduce Planarity Planar graph is 5-colorable (Heawood, 1890) Consider 5 components Planar graph is 4-colorable (Appel-Haken-Koch, 1977) Unavoidable configurations Planar and ∆-free graph is 3-colorable (Grotzsch, 1959) Grotzsch’s Theorem Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] From graph-3-colorability

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [5] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Graph-3-colorability, ∆-free & ∆≤4 (G3*) In NP: verify a coloring in O(|E|+|V|), BFS or DFS Reduction from G3 with ∆≤4 (G3): An instance of graph G3 without 4-clique; Consider the following auxiliary graph used to transform from G3 to graph G3* so that there exists a 3-coloring on G3 i.f.f. there is a proper 3-coloring on G3*: Auxiliary graph H: 1) ∆-free & 3-colorable; 2) b, e, f are colored 3 different colors; 3) b and c share the same color 1; 4) a and d are colored 2 and 3; therefore e and f are colored 3 and 2. 5) So b and g have same color 1 and degree 2; -- outlets

Start with G 0 = G: Repeat for i=1,…,n:  Consider each vertex u j, j=1,2,…,n;  If every neighborhood N(u j ) in G i has no edge or isomorphic to K 1,3, then G i =G i-1 ;  Else partition N(u j ) into two independent sets with size ≤2 and substitute u j with H(u j ), connecting the outlets to each sets; G* = G n  G* has no triangles and ∆≤4;  A proper 3-coloring to G is also a 3-coloring to G*  A proper 3-coloring to G* is also a 3-coloring to G. #

Framework In General: Graph-2-colorability is in N Graph-3-colorability is NP-complete (Reduce to k≥4) [2] Graph-3-colorability with ∆≤4 is NP-complete [1] Introduce Planarity: Planar graph is 5-colorable (1890), 4-colorable (1977) [3] Planar and ∆-free graph is 3-colorable (1959) [4] Graph-3-colorability on planar graph is NP-complete [1] Graph-3-colorability on planar graph with ∆≤4 is NP-complete [1] Introduce ∆-free: Graph-3-colorability on ∆-free graph with ∆≤4 is NP-complete [5] Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5]

Graph-k-colorability (∆?) Graph-k-colorability on ∆-free graph with ∆ bounded by a function of k, is NP-complete [5] A randomized polynomial time algorithm (Karger, Motwani Sudan, 1998 [8] ) gives min{O(∆ 1/3 log 1/2 ∆logn), O(n 1/4 log 1/2 n)} approximation on 3-colorable graph; and min{O(∆ 1-2/klog1/2 ∆logn), O(n1-3/(k+1)log1/2n)} approximation on k-colorable graph. Approximation Bound Non-constant guarantee [10], [11]: For any e>0, it is hard to obtain Ω(n -e ) factor approximation unless NP in ZPP(zero-error probabilistic polynomial time). Other approximation: 3-color: O(n 1/2 ) [7], ~O(n 0.25 ) [8], O(n ) [9]

References [1] M.R. Garey and D.S. Johnson, Computer and Intractability: A Guide to the Theory of Npcompleteness, W.H. Freeman, San Fransisco, [2] R.M. Karp, Reducibility among combinatorial problems, Plenum Press, New York, [3] D. West, Introduction to Graph Theory, 2nd edition, Prentice-Hall, 2001 [4] B. Grfinbaum, Grotzsch's theorem on 3-colorings, Michigan Math. J. 10, [5] F. Maffray and M. Preissmann, On the NP-completeness of the k-colorability problem for triangle-free graphs. Discrete Math. 162, 1996 [6] A. Wigderson. Improving the performance guarantee for approximate graph coloring. J. ACM, 30(4):729–735, 1983.

[8] D. R. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In IEEE Symposium on Foundations of Computer Science, [9] E. Chlamtac. Approximation algorithms using hierarchies of semidefinite programming relaxations. FOCS: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007 [10] U. Feige and J. Kilian. Zero Knowledge and chromatic number. In Proceedings of the 11 th Annual Conference on Structure in Complexity Theory, 1996 [11] U. Feige, S. Goldwasser, L. Lovasz, et.al. Interactive proofs and the hardness of approximating cliques. Em Journal of the ACM, 1996

Thanks! Questions and Comments?