Fully-dynamic Planarity Testing in Polylogarithmic Time

11/08/2019
by   Jacob Holm, et al.
0

Given a dynamic graph subject to insertions and deletions of edges, a natural question is whether the graph presently admits a planar embedding. We give a deterministic fully-dynamic algorithm for general graphs, running in amortized O(log^3 n) time per edge insertion or deletion, that maintains a bit indicating whether or not the graph is presently planar. This is an exponential improvement over the previous best algorithm [Eppstein, Galil, Italiano, Spencer, 1996] which spends amortized O(√(n)) time per update.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2022

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity

We study dynamic planar graphs with n vertices, subject to edge deletion...
research
09/28/2022

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs

A directed graph G is upward planar if it admits a planar embedding such...
research
07/17/2023

The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free

The main bottleneck in designing efficient dynamic algorithms is the unk...
research
03/12/2018

Point Location in Dynamic Planar Subdivisions

We study the point location problem on dynamic planar subdivisions that ...
research
11/13/2022

Improved Dynamic Colouring of Sparse Graphs

Given a dynamic graph subject to edge insertions and deletions, we show ...
research
02/21/2023

Dynamic Euclidean Bottleneck Matching

A fundamental question in computational geometry is for a set of input p...
research
10/25/2022

Efficient and Stable Fully Dynamic Facility Location

We consider the classic facility location problem in fully dynamic data ...

Please sign up or login with your details

Forgot password? Click here to reset