Pages that link to "Item:Q835050"

The following pages link to Finding a longest nonnegative path in a constant degree tree (Q835050):

Displaying 5 items.

• Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← 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)
• Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
• Algorithms and Computation (Q5191636) (← links)