A new linear-time algorithm for centroid decomposition
type: Item
instance of: scholarly article
title: A new linear-time algorithm for centroid decomposition
zbMATH Open document ID: 1539.68217
DOI: 10.1007/978-3-030-32686-9_20
author: Davide Della Giustina
author: Nicola Prezza
author: Rossano Venturini
publication date: 2024-04-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7834816
MaRDI profile type: Publication
cites work: Data structures for halfplane proximity queries and incremental Voronoi diagrams
cites work: Q4535015
cites work: On the weak prefix-search problem
cites work: Compressed Cache-Oblivious String B-Tree
cites work: Binary jumbled pattern matching on trees and tree-like structures
cites work: Succinct ordinal trees with level-ancestor queries
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: About groups of straight lines
cites work: Efficient counting of square substrings in a tree
cites work: A data structure for dynamic trees
description: scientific article; zbMATH DE number 7834816