R Gandhi1 and B Greening1 and S Pemmaraju2

R. Gandhi And B. Greening And S. Pemmaraju And R. Raman

Description

R. Gandhi1 and B. Greening1 and S. Pemmaraju2 and R. Raman3 Subcoloring and Hypocoloring Interval Graphs WG 2009 1Rutgers University, Camden. 2University of Iowa, USA. 3Max-Planck-Institut für Informatik, Germany June 24, 2009

• hypocoloring interval


• results approximation


• algorithm hypocoloring


• partition v1


• max-planck institut für

Sujets

• Rutgers University

Informations

• Publié par: pefav
• Nombre de lectures: 12
• Langue: English

Extrait

R.Gandhi 1 andB.Greening 1 andS.Pemmaraju 2 andR.Raman 3 SubcoloringandHypocoloring IntervalGraphs WG2009 1 RutgersUniversity,Camden. 2 UniversityofIowa,USA. 3 Max-Planck-Institutfür Informatik,Germany June24,2009

IntroductionApplications Subcoloring S.Pemmarajuetal. ResultsApproximationAlgorithmHypocoloring LetG=(V,E)beagraph. Questions ASubcoloringofGisapartition V 1 , ∙∙∙ , V k ofV,suchthat eachV i isaunionofdisjoint cliques. SubcoloringandHypocoloringIntervalGraphs 2

IntroductionApplications Subcoloring S.Pemmarajuetal. ResultsApproximationAlgorithmHypocoloring LetG=(V,E)beagraph. Questions ASubcoloringofGisapartition V 1 , ∙∙∙ , V k ofV,suchthat eachV i isaunionofdisjoint cliques. SubcoloringandHypocoloringIntervalGraphs 3

IntroductionApplications Subcoloring S.Pemmarajuetal. ResultsApproximationAlgorithmHypocoloring LetG =( V , E ) beagraph. Questions ASubcoloringofGisapartition V 1 , ∙∙∙ , V k ofV,suchthat eachV i isaunionofdisjoint cliques. SubcoloringandHypocoloringIntervalGraphs 4

IntroductionApplications Subcoloring S.Pemmarajuetal. ResultsApproximationAlgorithmHypocoloring LetG =( V , E ) beagraph. Questions ASubcoloringofGisapartition V 1 , ∙∙∙ , V k ofV,suchthat eachV i isaunionofdisjoint cliques. SubcoloringandHypocoloringIntervalGraphs 4