
Decremental SPQRtrees for Planar Graphs
We present a decremental data structure for maintaining the SPQRtree of...
read it

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
We present the first algorithm for maintaining a maximal independent set...
read it

Point Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that ...
read it

WorstCase Polylog Incremental SPQRtrees: Embeddings, Planarity, and Triconnectivity
We show that every labelled planar graph G can be assigned a canonical e...
read it

Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
In many real datasets such as social media streams and cyber data source...
read it

Sketchbased Randomized Algorithms for Dynamic Graph Regression
A wellknown problem in data science and machine learning is linear reg...
read it

On the Theory of Dynamic Graph Regression Problem
Most of realworld graphs are dynamic, i.e., they change over time. How...
read it
Fullydynamic Planarity Testing in Polylogarithmic Time
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 fullydynamic 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
Comments
There are no comments yet.