1 / 36

Split clique graph complexity

Split clique graph complexity. L. Alcón and M. Gutierrez La Plata, Argentina L. Faria and C. M. H. de Figueiredo, Rio de Janeiro, Brazil. Clique graph. A graph G is the clique graph of a graph H if G is the graph of intersection in vertices of the maximal cliques of H. 2. 1. 2.

lavender
Télécharger la présentation

Split clique graph complexity

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Split clique graph complexity L. Alcón and M. Gutierrez La Plata, Argentina L. Faria and C. M. H. de Figueiredo, Rio de Janeiro, Brazil

  2. Clique graph • A graph G is the clique graph of a graph H if G is the graph of intersection in vertices of the maximal cliques of H. 2 1 2 1 4 3 H G 4 3

  3. 2 1 2 1 4 3 H G 4 3 Our Problem

  4. Previous result • WG’2006 – CLIQUE GRAPH is NPC for graphs with maximum degree 14 and maximum clique size 12

  5. 2 1 4 G 3 1 2 3 H 4 Classes of graphs where CLIQUE GRAPH is polynomial Survey of Jayme L. Szwarcfiter

  6. A quest for a non-trivial Polynomial decidable class

  7. Chordal? • Clique structure, simplicial elimination sequence, … ? Split? • Same as chordal, one clique and one independent set … ?

  8. Our class: Split • G=(V,E) is a split graph if V=(K,S), where K is a complete set and S is an independent set

  9. Main used statements

  10. ksplitp • Given a pair of integers k > p, G is ksplitp if G is a split (K,S) graph and for every vertex s of S, p < d(s) < k. Example of 3split2

  11. In this talk • Establish 3 subclasses of split (K,S) graphs in P: 1. |S| < 3 2. |K| < 4 3. s has a private neighbour • CLIQUE GRAPH is NP-complete for 3split2

  12. s1 N(s1) s2 s3 N(s2) N(s3) 1. |S| < 3 G is clique graph iff G is not

  13. 2. |K| < 4 G is clique graph iff G has no bases set with

  14. 3. s has a private neighbour • G is a clique graph

  15. Our NPC problem CLIQUE GRAPH 3split2 INSTANCE: A 3 3split2 graph G=(V,E) with partition (K,S) QUESTION: Is there a graph H such that G=K(H)? NPC 3SAT3 INSTANCE: A set of variables U, a collection of clauses C, s.t. if c of C, then |c|=2 or |c|=3, each positive literal u occurs once, each negative literal occurs once or twice. QUESTION: Is there a truth assignment for U satisfying each clause of C?

  16. Some preliminaries • Black vertices in K • White vertices in S • Theorem – K is assumed in every 3split2 • RS-family

  17. 3split2

  18. 3split2

  19. The evil triangle s1 s2 k1 k3 k2 s3

  20. The main gadget Variable

  21. Variable

  22. Clause

  23. I=(U,C)=({u1, u2, u3, u4, u5, u6, u7}, {(u1,~u2), (u2,~u3), (~u1,u4), (~u2 ,~u4 ,~u5), (~u4 ,~u7), (u5 , ~u6 ,u7), (u3 , u6)}

  24. I=(U,C)=({u1, u2, u3, u4, u5, u6, u7}, {(u1,~u2), (u2,~u3), (~u1,u4), (~u2 ,~u4 ,~u5), (~u4 ,~u7), (u5 , ~u6 ,u7), (u3 , u6)} ~u1=~u2=~u3=~u4=~u5=~u6=u7=T

  25. Problem of theory of the sets Given a family of sets F, decide whether there exists a family F’, such that: • F’ is Helly, • Each F’ of F’ has size |F’|>1, • For each F of F, U F’ = F F’  F

  26. Our clique graph results

  27. Next step • Is CLIQUE NP-complete for planar graphs? • If G is a split planar graph => |K| < 4 => • => split planar clique is in P.

More Related