Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality

11/21/2022
by   Moe Kayali, et al.
0

We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classifying vertices, which can be used to build compact, lossless representations of graphs. However, its usefulness is limited due to its reliance on strict symmetries. Real data compresses very poorly using color refinement. We propose the first, to our knowledge, approximate color refinement scheme, which we call quasi-stable coloring. By using approximation, we alleviate the need for strict symmetry, and allow for a tradeoff between the degree of compression and the accuracy of the representation. We study three applications: Linear Programming, Max-Flow, and Betweenness Centrality, and provide theoretical evidence in each case that a quasi-stable coloring can lead to good approximations on the reduced graph. Next, we consider how to compute a maximal quasi-stable coloring: we prove that, in general, this problem is NP-hard, and propose a simple, yet effective algorithm based on heuristics. Finally, we evaluate experimentally the quasi-stable coloring technique on several real graphs and applications, comparing with prior approximation techniques. A reference implementation and the experiment code are available at https://github.com/mkyl/QuasiStableColors.jl .

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2021

2-distance (Δ+1)-coloring of sparse graphs using the potential method

A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
research
06/07/2021

Improving Lower Bounds for Equitable Chromatic Number

In many practical applications the underlying graph must be as equitable...
research
12/28/2019

Online Rainbow Coloring In Graphs

Rainbow coloring is a special case of edge coloring, where there must be...
research
07/12/2021

On λ-backbone coloring of cliques with tree backbones in linear time

A λ-backbone coloring of a graph G with its subgraph (also called a back...
research
07/18/2022

Robust Factorizations and Colorings of Tensor Graphs

Since the seminal result of Karger, Motwani, and Sudan, algorithms for a...
research
06/11/2019

A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths

In this paper we present an algorithm for finding a minimum dominator co...
research
02/26/2019

Coloring Big Graphs with AlphaGoZero

We show that recent innovations in deep reinforcement learning can effec...

Please sign up or login with your details

Forgot password? Click here to reset