Pages that link to "Item:Q987822"
From MaRDI portal
The following pages link to A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822):
Displaying 5 items.
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874) (← links)
- Enumeration of subtrees of trees (Q861266) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326) (← links)
- Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← links)