Maintaining Triconnected Components under Node Expansion

01/10/2023
by   Simon D. Fink, et al.
0

SPQR-trees are a central component of graph drawing and are also important in many further areas of computer science. From their inception onwards, they have always had a strong relation to dynamic algorithms maintaining information, e.g., on planarity and triconnectivity, under edge insertion and, later on, also deletion. In this paper, we focus on a special kind of dynamic update, the expansion of vertices into arbitrary biconnected graphs, while maintaining the SPQR-tree and further information. This will also allow us to efficiently merge two SPQR-trees by identifying the edges incident to two vertices with each other. We do this working along an axiomatic definition lifting the SPQR-tree to a stand-alone data structure that can be modified independently from the graph it might have been derived from. Making changes to this structure, we can now observe how the graph represented by the SPQR-tree changes, instead of having to reason which updates to the SPQR-tree are necessary after a change to the represented graph. Using efficient expansions and merges allows us to improve the runtime of the Synchronized Planarity algorithm by Bläsius et al. [ESA 2021] from O(m^2) to O(m·Δ), where Δ is the maximum pipe degree. This also reduces the time for solving several constrained planarity problems, e.g. for Clustered Planarity from O((n+d)^2) to O(n+d·Δ), where d is the total number of crossings between cluster borders and edges and Δ is the maximum number of edge crossings on a single cluster border.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2020

Edge colouring Game on Trees with maximum degree Δ=4

Consider the following game. We are given a tree T and two players (say)...
research
02/26/2018

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach

In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a l...
research
02/24/2020

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Graph coloring is a fundamental problem in computer science. We study th...
research
04/13/2018

Dynamic Low-Stretch Trees via Dynamic Low-Diameter Decompositions

Spanning trees of low average stretch on the non-tree edges, as introduc...
research
09/06/2021

Minimum Number of Bends of Paths of Trees in a Grid Embedding

We are interested in embedding trees T with maximum degree at most four ...
research
07/24/2019

Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank

We present a pointer-based data structure for constant time traversal of...
research
03/21/2023

Überprüfung von Integritätsbedingungen in Deduktiven Datenbanken

Advancements in computer science and AI lead to the development of large...

Please sign up or login with your details

Forgot password? Click here to reset