PPT-Data Reduction for Graph Coloring Problems

Bart M P Jansen Joint work with Stefan Kratsch August 22 nd 2011 Oslo Vertex Coloring of Graphs Given an undirected graph G and integer q can we assign each vertex

vertex distance graph coloring distance vertex coloring graph polynomial cover number reduction set treewidth chromatic forest data feedback split

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/466769" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "Data Reduction for Graph Coloring Proble..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.