The inverse Voronoi problem in graphs. II: Trees (Q2663704): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-020-00774-8
@@ Property / DOI: 10.1007/s00453-020-00774-8 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3092815978
@@ Property / OpenAlex ID: W3092815978 / rank @@
+Normal rank
@@ Property / cites work @@
+The inverse Voronoi problem in graphs. I: Hardness
+Normal rank
@@ Property / cites work @@
+Advanced Data Structures
@@ Property / cites work: Advanced Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in digraphs of small treewidth. I: Sequential algorithms
+Normal rank
@@ Property / cites work @@
+Q3358267
@@ Property / cites work: Q3358267 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
+Normal rank
@@ Property / DOI @@
+.1007/S00453-020-00774-8
@@ Property / DOI: 10.1007/S00453-020-00774-8 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2663704