Sparsification Lower Bound for Linear Spanners in Directed Graphs

03/16/2022
by   Prafullkumar Tale, et al.
0

For α≥ 1, β≥ 0, and a graph G, a spanning subgraph H of G is said to be an (α, β)-spanner if (u, v, H) ≤α·(u, v, G) + β holds for any pair of vertices u and v. These type of spanners, called linear spanners, generalizes additive spanners and multiplicative spanners. Recently, Fomin, Golovach, Lochet, Misra, Saurabh, and Sharma initiated the study of additive and multiplicative spanners for directed graphs (IPEC 2020). In this article, we continue this line of research and prove that Directed Linear Spanner parameterized by the number of vertices n admits no polynomial compression of size (n^2 - ϵ) for any ϵ > 0 unless ⊆/poly. We show that similar results hold for Directed Additive Spanner and Directed Multiplicative Spanner problems. This sparsification lower bound holds even when the input is a directed acyclic graph and α, β are any computable functions of the distance being approximated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2023

The directed metric dimension of directed co-graphs

A vertex w resolves two vertices u and v in a directed graph G if the di...
research
08/29/2021

Optimal Radio Labellings of Block Graphs and Line Graphs of Trees

A radio labeling of a graph G is a mapping f : V(G) →{0, 1, 2,...} such ...
research
07/03/2022

On the minimum number of arcs in k-dicritical oriented graphs

The dichromatic number (D) of a digraph D is the least integer k such th...
research
07/21/2023

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs

Despite extensive research on distance oracles, there are still large ga...
research
06/18/2021

Remarks about the Arithmetic of Graphs

The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where...
research
04/25/2018

Extensor-Coding

We devise an algorithm that approximately computes the number of paths o...
research
11/14/2019

Graph Spanners in the Message-Passing Model

Graph spanners are sparse subgraphs which approximately preserve all pai...

Please sign up or login with your details

Forgot password? Click here to reset