Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.05.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2040381019
@@ Property / OpenAlex ID: W2040381019 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
+Normal rank
@@ Property / cites work @@
+Finding a longest nonnegative path in a constant degree tree
+Normal rank
@@ Property / cites work @@
+An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the length-constrained heaviest path problem on a tree
+Normal rank
@@ Property / cites work @@
+An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
+Normal rank