Pages that link to "Item:Q2380075"
From MaRDI portal
The following pages link to Finding a maximum-density path in a tree under the weight and length constraints (Q2380075):
Displayed 5 items.
- The density maximization problem in graphs (Q386420) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← 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)
- Invulnerability of planar two-tree networks (Q1733045) (← links)