The inverse Voronoi problem in graphs. II: Trees (Q2663704): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The inverse Voronoi problem in graphs. I: Hardness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Advanced Data Structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3358267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-adjusting binary search trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank | |||
Normal rank | |||
Revision as of 00:07, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inverse Voronoi problem in graphs. II: Trees |
scientific article |
Statements
The inverse Voronoi problem in graphs. II: Trees (English)
0 references
19 April 2021
0 references
Voronoi diagram in graphs
0 references
inverse Voronoi problem
0 references
trees
0 references
applications of binary search trees
0 references
dynamic programming in trees
0 references
lower bounds
0 references
0 references
