The inverse Voronoi problem in graphs. II: Trees

DOI10.1007/s00453-020-00774-8OpenAlexW3092815978MaRDI QIDQ2663704

Hebert Pérez-Rosés, Édouard Bonnet, Bojan Mohar, Sergio Cabello

Publication date: 19 April 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.12547

zbMATH Keywords

treeslower boundsinverse Voronoi problemapplications of binary search treesdynamic programming in treesVoronoi diagram in graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Minimum consistent subset problem for trees ⋮ Minimum consistent subset of simple graph classes

Cites Work

• Unnamed Item
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• Shortest paths in digraphs of small treewidth. I: Sequential algorithms
• The inverse Voronoi problem in graphs. I: Hardness
• Advanced Data Structures
• Self-adjusting binary search trees
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

This page was built for publication: The inverse Voronoi problem in graphs. II: Trees