Pages that link to "Item:Q4651540"
From MaRDI portal
The following pages link to An Optimal Algorithm for the Maximum-Density Segment Problem (Q4651540):
Displayed 4 items.
- 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)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)