The following pages link to Net and prune (Q5495831):
Displaying 3 items.
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)