Pages that link to "Item:Q975556"
From MaRDI portal
The following pages link to An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556):
Displaying 10 items.
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758) (← links)
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822) (← links)
- An optimal algorithm for the maximum-density path in a tree (Q989545) (← links)
- Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes (Q2208245) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- Algorithms and Computation (Q5191636) (← links)
