The Bounded Path Tree Problem (Q4750668): Difference between revisions

@@ Property / author @@
+Paolo M. Camerini
@@ Property / author: Paolo M. Camerini / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/0603048
@@ Property / full work available at URL: https://doi.org/10.1137/0603048 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2064733879
@@ Property / OpenAlex ID: W2064733879 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems: Part I
@@ Property / cites work: Complexity of spanning tree problems: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
+Normal rank
@@ Property / cites work @@
+Q3316922
@@ Property / cites work: Q3316922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path problem is not harder than matrix multiplication
+Normal rank