Split clique graph complexity

Slides:

Advertisements

Apresentações semelhantes

Presenter’s Notes Some Background on the Barber Paradox

Advertisements

Multiplicação das Células

Um pouco mais sobre modelos de objetos. Ray Path Categorization Ray Path Categorization. Nehab, D.; Gattass, M. Proceedings of SIBGRAPI 2000, Brazil,

7 Abstração Genérica Unidades genéricas e instanciação.

Vetor da rede recíproca.

And now, the end is here E agora o fim está próximo, And so I face the final curtain E então eu encaro a última cortina. My friend, I'll say it clear.

Fazendo e Brincando: Confecção de Materiais para as Aulas de Inglês

Sphere CDV Fundamentals of Spherical Parameterization for 3D Meshes MOTIVAÇÕES: - Remeshing - Morphing.

Universidade de Brasília Laboratório de Processamento de Sinais em Arranjos 1 Adaptive & Array Signal Processing AASP Prof. Dr.-Ing. João Paulo C. Lustosa.

Avaliação Constituição dos grupos de trabalho:

Lecture 4 Pressure distribution in fluids. Pressure and pressure gradient. Hydrostatic pressure 1.

Possessive adjectives

Ray Tracing Daniel de Vasconcelos Campos. Tópicos Problema proposto Análise do problema Algumas Técnicas Pesquisadas Algoritmo Implementado.

TOURISM IN BRAZIL. a little bit about the country …  largest country in South America  population with over 192 million people  Bounded by the Atlantic.

Estratégias de Resolução

Criptografia Problema 5. Equipe  Hallan Cosmo - hcs  Phillip César - pcas.

Aula Prática 5. Fluxes Consider the flow in a rectangular duct, formed by two paralell plates (width b=1m and height 2h= 30cm) where air (=1.2 kg/m3)

The Campesino a Campesino Movement The Campesino a Campesino movement is an extensive grassroots movement in Central America and Mexico. It is a cultural.

Seduces-me Celine Dion Seduces-me Celine Dion Everything you are Tudo o que você é Everything you'll be Tudo o que você será Touches the current of love.

Video Capítulo 8: Impasses. Silberschatz, Galvin and Gagne  Video Operating System Concepts Assuntos n Modelo de Sistemas n Carcterização de.

Running time: O(n + m) BFS(G) 1 for every vertex s of G not explored yet 2 do Enqueue(S,s) 3 mark vertex s as visited 4 while S is not empty do 5 u ← Dequeue(S);

MAC Engenharia de Software Marco A. GerosaIME / USP Mais sobre análise e Outros Diagramas UML MAC0332 Engenharia de Software Marco Aurélio Gerosa.

StatePopulationArea (km²)Density (people/km²) Acre Amazonas Roraima Rondônia Amapá

RIO DE JANEIRO BY APOSTOLIS KOMNINOS PUPIL OF E2 CLASS.

Limit Equlibrium Method. Limit Equilibrium Method Failure mechanisms are often complex and cannot be modelled by single wedges with plane surfaces. Analysis.

© 2007 IBM Corporation Academic Initiative 07/05/07 Aula 2 – Parte 1: Java Basics Autores: Argemiro José de Juliano Marcos

Universidade de Brasília Laboratório de Processamento de Sinais em Arranjos 1 Adaptive & Array Signal Processing AASP Prof. Dr.-Ing. João Paulo C. Lustosa.

Falhas em componentes de sustentação – Cabos de Aço, Correntes e Ganchos.

APPLICATIONS OF DIFFERENTIAL EQUATIONS - ANIL. S. NAYAK.

APPLICATIONS OF DIFFERENTIAL EQUATIONS PRESENTED TO:DR.SADIA ARSHAD PRESENTED BY:ASHHAD ABBAS GILANI(026) SHAHAB ARSHAD(058) RIAZ HUSSAIN(060) MUHAMMAD.

Fogbow: a middleware for the federation of private clouds Francisco Brasileiro Cloudscape Brazil, Rio de Janeiro.

Pesquisa Operacional aplicada à Gestão de Produção e Logística Prof. Eng. Junior Buzatto Case 4.

Pesquisa Operacional aplicada à Gestão de Produção e Logística Prof. Eng. Junior Buzatto Case 3.

O simple present é um tempo verbal que descreve uma ação que acontece o tempo todo ou com uma certa frequência. Humans communicate in different ways.

“Eles não aprendem português quanto mais inglês” Moita Lopes, L.P Oficina de Linguística Aplicada Mercado de Letras. pp

Part I Object of Plasma Physics BACK. I. Object of Plasma Physics 1. Characterization of the Plasma State 2. Plasmas in Nature 3. Plasmas in the Laboratory.

MELHOR VISUALIZAÇÃO NO POWER POINT 2000 And now, the end is here E agora o fim está próximo, And so I face the final curtain E então eu encaro a última.

Learning english with comics …………….. Aprendendo inglês com quadrinhos.

Does the quality of institutions matter? Protests in Brazil under Rousseff’s government. André Canuto 74th annual MPSA Conference.

THERE IS / THERE ARE A / AN, SOME, ANY.

Visão geral do Aprendizado de máquina

Grammar Reference Relative Pronouns Upgrade 2 - Unit 8

Map of Brazil Illustrations of countntry and administry districts.

TQS - Teste e Qualidade de Software (Software Testing and Quality) Geração Automática de Casos de Teste com a Ferramenta.

ISOMORFISMOS REPRESENTAÇÕES MATRICIAIS

Grammar Reference: Modal Verbs

Three analogies to explain reactive power Why an analogy? Reactive power is an essential aspect of the electricity system, but one that is difficult to.

Wondershare software On the [View] menu, point to [Master], and then click [Slide Master] or [Notes Master].

turma de hotelaria 2012 reservas

I am from BRAZIL!.

SIMPLE PRESENT TENSE.

Grammar Reference Simple Future Future Continuous Upgrade 2 - Unit 2

Grammar Reference: Modal Verbs

Aula Prática Modelagem de Duração

Brazil South America.

My Way - Frank Sinatra And now, the end is here E agora o fim está próximo, And so I face the final curtain E então eu.

Tópicos Avançados em Engenharia de Software

Top-Down Parsing Teoría de Autómatas y Lenguajes Formales

Unidade 8 Cultural Identity

Grammar Reference: Modal Verbs

Developing a Hypothesis

Introduction to Machine learning

How to learn English THE EASY WAY. Ways to learn english Music; Games; Apps; Movies/Series;

Introduction to density estimation Modelação EcoLÓGICA

R. A. R. Ramos, D. S. Rodrigues, L. C. L. Souza,

There are no errors in this program, except this one.

Pesquisadores envolvidos Recomenda-se Arial 20 ou Times New Roman 21.

GENOCIDES THAT NEVER WILL BE FORGET. GENOCIDE: The deliberate killing of a large group of people, especially those of a particular nation or ethnic group.

Transcrição da apresentação:

Split clique graph complexity Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Our Problem 1 2 3 4 G 1 2 3 4 H Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Previous result WG’2006 – CLIQUE GRAPH is NPC for graphs with maximum degree 14 and maximum clique size 12 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

G H 1 2 3 4 1 2 3 4 Classes of graphs where CLIQUE GRAPH is polynomial Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Classes of graphs where CLIQUE GRAPH is polynomial 1 2 3 4 G 1 2 3 4 H Survey of Jayme L. Szwarcfiter Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

A quest for a non-trivial Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. A quest for a non-trivial Polynomial decidable class Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Chordal? Split? Clique structure, simplicial elimination sequence, … ? Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Chordal? Clique structure, simplicial elimination sequence, … ? Split? Same as chordal, one clique and one independent set … ? Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

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

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Main used statements Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

In this talk 1. |S| < 3 2. |K| < 4 3. s has a private neighbour Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

s1 1. |S| < 3 N(s1) s3 s2 N(s2) N(s3) G is clique graph iff Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. s1 1. |S| < 3 N(s2) N(s1) N(s3) s3 s2 G is clique graph iff G is not Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

2. |K| < 4 G is clique graph iff G has no bases set with Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 2. |K| < 4 G is clique graph iff G has no bases set with Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

3. s has a private neighbour Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 3. s has a private neighbour G is a clique graph Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Our NPC problem NPC CLIQUE GRAPH 3split2 3SAT3 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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? Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Some preliminaries Black vertices in K White vertices in S Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Some preliminaries Black vertices in K White vertices in S Theorem – K is assumed in every 3split2 RS-family Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 3split2 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 3split2 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

The evil triangle s1 s2 k1 k3 k2 s3 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. The evil triangle s1 s2 k1 k3 k2 s3 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

The main gadget Variable Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. The main gadget Variable Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Variable Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Clause Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Clique graph is NP-complete - Álcon, L. , Faria, L. , de Figueiredo, C Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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)} Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

~u1=~u2=~u3=~u4=~u5=~u6=u7=T Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Problem of theory of the sets Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. 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 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Our clique graph results Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Our clique graph results 3split3 3split2 s of S has a private neighbor |S| bounded |K| bounded Split graph G = (V,E) partition V=(K,S) ? NPC P |S| < 3 general |K| < 4 Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.

Next step If G is a split planar graph => |K| < 4 => Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M. Next step If G is a split planar graph => |K| < 4 => => split planar clique is in P. Is CLIQUE NP-complete for planar graphs? Clique graph is NP-complete - Álcon, L., Faria, L., de Figueiredo, C. M. H., Gutierrez, M.