Splay Top Trees

10/21/2022
by   Jacob Holm, et al.
0

The top tree data structure is an important and fundamental tool in dynamic graph algorithms. Top trees have existed for decades, and today serve as an ingredient in many state-of-the-art algorithms for dynamic graphs. In this work, we give a new direct proof of the existence of top trees, facilitating simpler and more direct implementations of top trees, based on ideas from splay trees. This result hinges on new insights into the structure of top trees, and in particular the structure of each root path in a top tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2018

Weighted dynamic finger in binary search trees

It is shown that the online binary search tree data structure GreedyASS ...
research
02/08/2019

Faster Repetition-Aware Compressed Suffix Trees based on Block Trees

Suffix trees are a fundamental data structure in stringology, but their ...
research
12/27/2021

How to choose the root: centrality measures over tree structures

Centrality measures are commonly used to analyze graph-structured data; ...
research
06/28/2021

Experimental Comparison of PC-Trees and PQ-Trees

PQ-trees and PC-trees are data structures that represent sets of linear ...
research
06/09/2023

Leaping through tree space: continuous phylogenetic inference for rooted and unrooted trees

Phylogenetics is now fundamental in life sciences, providing insights in...
research
06/13/2021

A Phylogenetic Trees Analysis of SARS-CoV-2

One regards spaces of trees as stratified spaces, to study distributions...
research
10/13/2017

On the Ontological Modeling of Trees

Trees -- i.e., the type of data structure known under this name -- are c...

Please sign up or login with your details

Forgot password? Click here to reset