Work

Splay Top Trees

Year: 2023

Type: conference-paper

Abstract: 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. In amortized analysis, our top trees match the asymptotic bounds of the state of the art.

Source: Society for Industrial and Applied Mathematics eBooks

DOI: 10.1137/1.9781611977585.ch28

Authors: Jacob Holm, Eva Rotenberg, Alice Ryhl

Institutions: University of Copenhagen, Technical University of Denmark

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Villum Fonden, Bhabha Atomic Research Centre

Awards: G4422840520, G5709038784