dynamic graph coloring
play

Dynamic Graph Coloring Luis Barba 1 Jean Cardinal 2 Matias Korman 3 - PowerPoint PPT Presentation

Dec 04, 2022 •305 likes •906 views

Dynamic Graph Coloring Luis Barba 1 Jean Cardinal 2 Matias Korman 3 Stefan Langerman 2 Andr van Renssen 4 , 5 Marcel Roeloffzen 4 , 5 Sander Verdonschot 6 1 ETH Zrich 2 Universit Libre de Bruxelles 3 Tohoku University 4 National Institute of

  1. Dynamic Graph Coloring Luis Barba 1 Jean Cardinal 2 Matias Korman 3 Stefan Langerman 2 André van Renssen 4 , 5 Marcel Roeloffzen 4 , 5 Sander Verdonschot 6 1 ETH Zürich 2 Université Libre de Bruxelles 3 Tohoku University 4 National Institute of Informatics 5 JST, ERATO, Kawarabayashi Large Graph Project 6 Carleton University July 31, 2017 Sander Verdonschot Dynamic Graph Coloring

  2. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  3. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  4. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  5. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  6. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  7. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  8. Problem • Maintain a proper coloring of a changing graph Sander Verdonschot Dynamic Graph Coloring

  9. Problem • Maintain a proper coloring of a changing graph: • Add & remove edges • Add & remove vertices with incident edges Sander Verdonschot Dynamic Graph Coloring

  10. Limit the number of vertex color changes • Easy! Use a new color for every change Limit the number of colors Problem • Easy! Recompute the coloring for every change Sander Verdonschot Dynamic Graph Coloring

  11. • Easy! Use a new color for every change Limit the number of colors Problem • Easy! Recompute the coloring for every change ⇒ Limit the number of vertex color changes Sander Verdonschot Dynamic Graph Coloring

  12. Limit the number of colors Problem • Easy! Recompute the coloring for every change ⇒ Limit the number of vertex color changes • Easy! Use a new color for every change Sander Verdonschot Dynamic Graph Coloring

  13. Problem • Easy! Recompute the coloring for every change ⇒ Limit the number of vertex color changes • Easy! Use a new color for every change ⇒ Limit the number of colors Sander Verdonschot Dynamic Graph Coloring

  14. 2 n • No vertex recolorings n colors for n -colorable graph [Halldórsson & Szegedy, 1992] Our results • O d -approximate coloring with O dn 1 d recolorings • O dn 1 d -approximate coloring with O d recolorings 2 • Maintaining a c -coloring requires n recolorings c c 1 Problem • Trade off the number of colors vs vertex color changes • Optimal coloring ⇒ Ω ( n ) vertex recolorings per update Sander Verdonschot Dynamic Graph Coloring

  15. Our results • O d -approximate coloring with O dn 1 d recolorings • O dn 1 d -approximate coloring with O d recolorings 2 • Maintaining a c -coloring requires n recolorings c c 1 Problem • Trade off the number of colors vs vertex color changes • Optimal coloring ⇒ Ω ( n ) vertex recolorings per update 2 n • No vertex recolorings ⇒ log n colors for log n -colorable graph [Halldórsson & Szegedy, 1992] Sander Verdonschot Dynamic Graph Coloring

  16. 2 • Maintaining a c -coloring requires n recolorings c c 1 Problem • Trade off the number of colors vs vertex color changes • Optimal coloring ⇒ Ω ( n ) vertex recolorings per update 2 n • No vertex recolorings ⇒ log n colors for log n -colorable graph [Halldórsson & Szegedy, 1992] Our results • O ( d ) -approximate coloring with O ( dn ( 1 / d ) ) recolorings • O ( dn ( 1 / d ) ) -approximate coloring with O ( d ) recolorings Sander Verdonschot Dynamic Graph Coloring

  17. Problem • Trade off the number of colors vs vertex color changes • Optimal coloring ⇒ Ω ( n ) vertex recolorings per update 2 n • No vertex recolorings ⇒ log n colors for log n -colorable graph [Halldórsson & Szegedy, 1992] Our results • O ( d ) -approximate coloring with O ( dn ( 1 / d ) ) recolorings • O ( dn ( 1 / d ) ) -approximate coloring with O ( d ) recolorings 2 • Maintaining a c -coloring requires Ω ( n c ( c − 1 ) ) recolorings Sander Verdonschot Dynamic Graph Coloring

  18. Upper bound: big-buckets • Vertices are placed in buckets Sander Verdonschot Dynamic Graph Coloring

  19. Upper bound: big-buckets • Each bucket has a fixed size and its own set of colors . . . n 1 /d n 2 /d n ∞ Sander Verdonschot Dynamic Graph Coloring

  20. Upper bound: big-buckets • Initially, all vertices are in the reset bucket Sander Verdonschot Dynamic Graph Coloring

  21. Upper bound: big-buckets • Changed vertices are placed in the first bucket Sander Verdonschot Dynamic Graph Coloring

  22. Upper bound: big-buckets • Changed vertices are placed in the first bucket Sander Verdonschot Dynamic Graph Coloring

  23. Upper bound: big-buckets • Changed vertices are placed in the first bucket Sander Verdonschot Dynamic Graph Coloring

  24. Upper bound: big-buckets • Changed vertices are placed in the first bucket Sander Verdonschot Dynamic Graph Coloring

  25. Upper bound: big-buckets • When a bucket fills up, it is emptied in the next one Sander Verdonschot Dynamic Graph Coloring

  26. Upper bound: big-buckets • When a bucket fills up, it is emptied in the next one Sander Verdonschot Dynamic Graph Coloring

  27. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  28. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  29. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  30. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  31. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  32. Upper bound: big-buckets • New vertices also go to the first bucket Sander Verdonschot Dynamic Graph Coloring

  33. Upper bound: big-buckets • New vertices also go to the first bucket ( d + 1 ) -approximate coloring with O ( dn 1 / d ) recolorings per update n 2 n n ( d − 1 ) /d n n 2 /d . . . n 1 /d n 1 /d Sander Verdonschot Dynamic Graph Coloring

  34. Upper bound: small-buckets • Split each big bucket into n 1 / d smaller ones • O ( dn 1 / d ) -approximate coloring with d + 2 recolorings per update n 1 /d n 1 /d n 1 /d 1 1 1 . . . n 1 /d n 1 /d Sander Verdonschot Dynamic Graph Coloring

  35. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Warm-up: 2-coloring a forest Sander Verdonschot Dynamic Graph Coloring

  36. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Build 3 stars of size n / 3 Sander Verdonschot Dynamic Graph Coloring

  37. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Connect 2 with the same color root Sander Verdonschot Dynamic Graph Coloring

  38. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Connect 2 with the same color root Sander Verdonschot Dynamic Graph Coloring

  39. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Connect 2 with the same color root . Repeat Sander Verdonschot Dynamic Graph Coloring

  40. • Maintaining a 2-coloring of a forest requires n recolorings per update Lower bound • Connect 2 with the same color root . Repeat Sander Verdonschot Dynamic Graph Coloring

  41. Lower bound • Connect 2 with the same color root . Repeat • Maintaining a 2-coloring of a forest requires Ω ( n ) recolorings per update Sander Verdonschot Dynamic Graph Coloring

  42. Lower bound • 3-coloring a forest Sander Verdonschot Dynamic Graph Coloring

  43. Lower bound • Build n 1 / 3 stars of size n 2 / 3 n 1 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  44. Lower bound • Assign most common leaf colour to trees n 1 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  45. Lower bound • Keep at least n 1 / 3 / 3 with the same color n 1 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  46. Lower bound • Keep at least n 1 / 3 / 3 with the same color n 1 / 3 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  47. Lower bound • Group into 3 big trees, each with n 1 / 3 / 9 small trees n 1 / 3 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  48. Lower bound • Group into 3 big trees, each with n 1 / 3 / 9 small trees n 1 / 3 / 3 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  49. Lower bound • If at any point, a small tree has no blue children, reset n 1 / 3 / 9 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  50. Lower bound • If at any point, a small tree has no blue children, reset n 1 / 3 / 9 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  51. Lower bound • Roots of small trees are orange or red n 1 / 3 / 9 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

  52. Lower bound • Connect two big trees with same root color n 1 / 3 / 9 n 2 / 3 n 2 / 3 n 2 / 3 Sander Verdonschot Dynamic Graph Coloring

Recommend

Graph Coloring Independent Set and Coloring k -Coloring : 3-Coloring IndependentSet Instance:

Graph Coloring Independent Set and Coloring k -Coloring : 3-Coloring IndependentSet Instance:

CS500 CS500 Graph Coloring Independent Set and Coloring k -Coloring : 3-Coloring IndependentSet Instance: A graph G . Question: Can the vertices of G be colored with k colors such that no two vertices of the same color are adjacent? (Note

226 views • 4 slides
GRAPH COLORING ON THE GPU AND SOME TECHNIQUES TO IMPROVE LOAD IMBALANCE SHUAI CHE, GREGORY

GRAPH COLORING ON THE GPU AND SOME TECHNIQUES TO IMPROVE LOAD IMBALANCE SHUAI CHE, GREGORY

GRAPH COLORING ON THE GPU AND SOME TECHNIQUES TO IMPROVE LOAD IMBALANCE SHUAI CHE, GREGORY RODGERS, BRAD BECKMANN, STEVE REINHARDT AMD SPEAKER: DIBYENDU DAS GRAPH COLORING Graph coloring is a key building block for many graph applications

839 views • 15 slides
Graph coloring Simone Campanoni simonec@eecs.northwestern.edu Outline Graph coloring

Graph coloring Simone Campanoni simonec@eecs.northwestern.edu Outline Graph coloring

Graph coloring Simone Campanoni simonec@eecs.northwestern.edu Outline Graph coloring Heuristics L2c Graph coloring task Input : the interference graph Output: the interference graph where each node has a color Task:

881 views • 25 slides
Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns

Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns

Today. Graph Coloring. Planar graphs and maps. Given G = ( V , E ) , a coloring of a G assigns colors to vertices V Planar graph coloring map coloring. where for each edge the endpoints have different colors. Planar Five Color theorem.

540 views • 4 slides
Sublinear Algorithms for Graph Coloring Sanjeev Khanna University of Pennsylvania Joint work

Sublinear Algorithms for Graph Coloring Sanjeev Khanna University of Pennsylvania Joint work

Sublinear Algorithms for Graph Coloring Sanjeev Khanna University of Pennsylvania Joint work with Sepehr Assadi (Princeton) and Yu Chen (Penn). Graph Coloring A -coloring of a graph , assigns each vertex a color from the

1.05k views • 58 slides
Advanced graph coloring Simone Campanoni simonec@eecs.northwestern.edu A coloring algorithm

Advanced graph coloring Simone Campanoni simonec@eecs.northwestern.edu A coloring algorithm

Advanced graph coloring Simone Campanoni simonec@eecs.northwestern.edu A coloring algorithm Algorithm: 1. Repeatedly select a node and remove it from the graph, putting it on top of a stack 2. When the graph is empty, rebuild it Select a

512 views • 29 slides
Graph Coloring Graph Coloring CSE, IIT KGP K- - coloring coloring K A A k k- -coloring

Graph Coloring Graph Coloring CSE, IIT KGP K- - coloring coloring K A A k k- -coloring

Graph Coloring Graph Coloring CSE, IIT KGP K- - coloring coloring K A A k k- -coloring coloring of G is a labeling of G is a labeling f:V(G) f:V(G) {1, {1, ,k}. ,k}. The labels are The labels are colors colors

2.83k views • 14 slides
Parameterized Maximum Path Coloring Michael Lampis September 9, 2011 1 / 17 Path Coloring

Parameterized Maximum Path Coloring Michael Lampis September 9, 2011 1 / 17 Path Coloring

Parameterized Maximum Path Coloring Michael Lampis September 9, 2011 1 / 17 Path Coloring Definition Path Coloring Path Coloring Example Known results Input : A graph G and a multi-set of paths on that graph Edge slicing

704 views • 47 slides
Obstructions against 3-coloring graphs without long induced paths Oliver Schaudt Universit at

Obstructions against 3-coloring graphs without long induced paths Oliver Schaudt Universit at

Obstructions against 3-coloring graphs without long induced paths Oliver Schaudt Universit at zu K oln & RWTH Aachen with Maria Chudnovsky, Jan Goedgebeur, and Mingxian Zhong Graph coloring Graph coloring a k-coloring is an

588 views • 45 slides
3-coloring graphs without induced paths on seven vertices Oliver Schaudt Universit at zu K

3-coloring graphs without induced paths on seven vertices Oliver Schaudt Universit at zu K

3-coloring graphs without induced paths on seven vertices Oliver Schaudt Universit at zu K oln, Institut f ur Informatik with Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Maya Stein, and Mingxian Zhong Graph coloring Graph coloring

598 views • 56 slides
On-line Graph Coloring Iwona Cie slik Algorithmics Research Group, Jagiellonian University,

On-line Graph Coloring Iwona Cie slik Algorithmics Research Group, Jagiellonian University,

On-line coloring Competitiveness Results Example On-line Graph Coloring Iwona Cie slik Algorithmics Research Group, Jagiellonian University, Cracow, Poland Chambry, June 2005 Iwona Cie slik On-line Graph Coloring On-line coloring

981 views • 55 slides
Coloring graphs without long induced paths Oliver Schaudt Universit at zu K oln & RWTH

Coloring graphs without long induced paths Oliver Schaudt Universit at zu K oln & RWTH

Coloring graphs without long induced paths Oliver Schaudt Universit at zu K oln & RWTH Aachen with Flavia Bonomo, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Maya Stein, and Mingxian Zhong Graph coloring Graph coloring a

921 views • 90 slides
Graph coloring Kevin Ly September 20, 2019 Itinerary Introduction to simple graphs A

Graph coloring Kevin Ly September 20, 2019 Itinerary Introduction to simple graphs A

Graph coloring Kevin Ly September 20, 2019 Itinerary Introduction to simple graphs A brief game of matching The coloring problem and DSATUR Networkx demo Graphs primer A simple graph G consists of a set V and a set of pairs E .

524 views • 23 slides
These slides are intended for those familiar with graphs and graph coloring. 1 Slide 1 Ordinarily

These slides are intended for those familiar with graphs and graph coloring. 1 Slide 1 Ordinarily

These slides are intended for those familiar with graphs and graph coloring. 1 Slide 1 Ordinarily a graph G is considered to be (properly) colored when each vertex has one color, and the colors of neighboring vertices are distinct. The smallest

686 views • 29 slides
Some Pretty Edge Coloring Conjectures Rong Luo Department of Mathematics West Virginia

Some Pretty Edge Coloring Conjectures Rong Luo Department of Mathematics West Virginia

Some Pretty Edge Coloring Conjectures Rong Luo Department of Mathematics West Virginia University Rong Luo (WVU) Some Pretty Edge Coloring Conjectures 1 / 1 Introduction A simple graph is a graph without multiple edges while a graph means

1.37k views • 122 slides
Safe Lower Bounds for Graph Coloring Stephan Held joint work with Edward C. Sewell and William

Safe Lower Bounds for Graph Coloring Stephan Held joint work with Edward C. Sewell and William

Safe Lower Bounds for Graph Coloring Stephan Held joint work with Edward C. Sewell and William Cook Aussois Janurary, 2011 Outline The Coloring IP A new algorithm for finding maximum-weight stable sets Safe computations with inaccurate

905 views • 41 slides
Global Register Allocation Memory Hierarchy Management Register Allocation via Graph

Global Register Allocation Memory Hierarchy Management Register Allocation via Graph

Lecture Outline Global Register Allocation Memory Hierarchy Management Register Allocation via Graph Coloring Register interference graph Graph coloring heuristics Spilling Cache Management Compiler Design I

142 views • 11 slides
Vertex Coloring Stefan Schmid @ T-Labs, 2011 Graph Coloring Stefan Schmid @ T-Labs Berlin, 2012

Vertex Coloring Stefan Schmid @ T-Labs, 2011 Graph Coloring Stefan Schmid @ T-Labs Berlin, 2012

Foundations of Distributed Systems: Vertex Coloring Stefan Schmid @ T-Labs, 2011 Graph Coloring Stefan Schmid @ T-Labs Berlin, 2012 2 How to color? Chromatic number? Tree! Two colors enough... Stefan Schmid @ T-Labs Berlin, 2012 3 And now?

728 views • 35 slides
or Xglqt G qcq ipcq.es qq.TO ve E 2 Vz Case I X Cuz XCuz 0 g 10 g I qlq DLq.cl XH g H case

or Xglqt G qcq ipcq.es qq.TO ve E 2 Vz Case I X Cuz XCuz 0 g 10 g I qlq DLq.cl XH g H case

Colorings Chromatic Polynomial Formula DeletionContraction SymmetricChromaticFunction Stanley specialization Symmetry Deletion Contraction Coloring of a graph G X VG 1,2 17 9222 01 0 0 Ppezr coloring Hedges Lynde EGS 022 1 22 XLV

714 views • 3 slides
Compilers Spilling Alex Aiken Spilling What happens if the graph coloring heuristic fails to

Compilers Spilling Alex Aiken Spilling What happens if the graph coloring heuristic fails to

Compilers Spilling Alex Aiken Spilling What happens if the graph coloring heuristic fails to find a coloring? In this case, we cant hold all values in registers. Some values are spilled to memory Alex Aiken Spilling What if

340 views • 16 slides
Chapter 6 Vertex and edge coloring Prof. Tesler Math 154 Winter 2020 Prof. Tesler Ch. 6:

Chapter 6 Vertex and edge coloring Prof. Tesler Math 154 Winter 2020 Prof. Tesler Ch. 6:

Chapter 6 Vertex and edge coloring Prof. Tesler Math 154 Winter 2020 Prof. Tesler Ch. 6: Graph colorings Math 154 / Winter 2020 1 / 54 Coloring vertices of a graph Let G be a graph and C be a set of colors , e.g., C = { black, white } C = {

1.23k views • 54 slides
List coloring and crossings Zden ek Dvo rk, Bernard Lidick and Riste krekovski

List coloring and crossings Zden ek Dvo rk, Bernard Lidick and Riste krekovski

List coloring and crossings Zden ek Dvo rk, Bernard Lidick and Riste krekovski Charles University University of Ljubljana CanaDAM 2011 - Victoria List coloring and crossings List coloring - quick reminder Let G be a graph and C set

525 views • 29 slides
Outline What is Register Allocation Webs Interference Graphs Graph Coloring

Outline What is Register Allocation Webs Interference Graphs Graph Coloring

Outline What is Register Allocation Webs Interference Graphs Graph Coloring Register Allocation Spilling Live-Range Splitting More Variations and Optimizations Kostis Sagonas 2 Spring 2012 Storing values

690 views • 13 slides
Interference graph Simone Campanoni simonec@eecs.northwestern.edu A graph-coloring register

Interference graph Simone Campanoni simonec@eecs.northwestern.edu A graph-coloring register

Interference graph Simone Campanoni simonec@eecs.northwestern.edu A graph-coloring register allocator structure f f Liveness Register allocator analysis f with Code IN, OUT var spilled analysis Interferences Spill analysis spill( f ,

413 views • 12 slides

More recommend