AI Chat AI Image Generator AI Video Text to Speech

Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs

07/14/2023

∙

by Shiri Chechik, et al.

∙

∙

We show how to assign labels of size Õ(1) to the vertices of a directed planar graph G, such that from the labels of any three vertices s,t,f we can deduce in Õ(1) time whether t is reachable from s in the graph G∖{f}. Previously it was only known how to achieve Õ(1) queries using a centralized Õ(n) size oracle [SODA'21].

Shiri Chechik
11 publications
Shay Mozes
15 publications
Oren Weimann
15 publications

page 1

page 2

page 3

page 4

research

∙ 02/14/2021

Fault-Tolerant Distance Labeling for Planar Graphs

In fault-tolerant distance labeling we wish to assign short labels to th...

0 Aviv Bar-Natan, et al. ∙

research

∙ 07/16/2018

Exact Distance Oracles for Planar Graphs with Failing Vertices

We consider exact distance oracles for directed weighted planar graphs i...

0 Panagiotis Charalampopoulos, et al. ∙

research

∙ 08/09/2019

Shorter Labeling Schemes for Planar Graphs

An adjacency labeling scheme for a given class of graphs is an algorithm...

0 Marthe Bonamy, et al. ∙

research

∙ 01/07/2021

Planar Reachability Under Single Vertex or Edge Failures

In this paper we present an efficient reachability oracle under single-e...

0 Giuseppe F. Italiano, et al. ∙

research

∙ 04/12/2023

A Hall-type theorem with algorithmic consequences in planar graphs

Given a graph G=(V,E), for a vertex set S⊆ V, let N(S) denote the set of...

0 Ebrahim Ghorbani, et al. ∙

research

∙ 04/17/2019

A Brief Note on Single Source Fault Tolerant Reachability

Let G be a directed graph with n vertices and m edges, and let s ∈ V(G) ...

0 Daniel Lokshtanov, et al. ∙

research

∙ 03/05/2022

Efficient Reachability Ratio Computation for 2-hop Labeling Scheme

As one of the fundamental graph operations, reachability queries process...

0 Junfeng Zhou, et al. ∙