Pages that link to "Item:Q846172"
From MaRDI portal
The following pages link to Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172):
Displayed 3 items.
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
