Iyad Kanj DePaul University Chicago Joint Work With

Andreas Wiese

Description

Iyad Kanj DePaul University, Chicago Joint Work With Andreas Wiese Technische Universitat, BerlinFenghui Zhang Google, Seattle

• edge coloring


• strong edge


• known results ?


• problem definition ?edge


• centralized model

Sujets

• Google
• Edge coloring

Informations

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

Extrait

                       ua lDPesierivUnicCh, tyoga

 

 Andreas Wiese Technische Universitat, Berlin Fenghui Zhang Google, Seattle

Joint Work With

Iyad Kanj

Problem Definition





Edge Coloring: color the edges of a given graph with the minimum number of colors such that no two adjacent edges receive the same color

color teh egdes ofa g ivneg ra

  Strong Edge Coloring: with the minimum number of colors such that no two edges of distance ≤ 2 receive the same color

p

 Both problems are NP-hard (on general graphs)

h