Pages that link to "Item:Q1781798"
From MaRDI portal
The following pages link to Finding a length-constrained maximum-density path in a tree (Q1781798):
Displaying 12 items.
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- Finding a longest nonnegative path in a constant degree tree (Q835050) (← links)
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- An optimal algorithm for the maximum-density path in a tree (Q989545) (← links)
- A pathfinding problem for search trees with unknown edge length (Q1784979) (← links)
- Finding a maximum-density path in a tree under the weight and length constraints (Q2380075) (← links)
- (Q3743340) (← links)
- Algorithms and Computation (Q5191636) (← links)
