Pages that link to "Item:Q5233508"
From MaRDI portal
The following pages link to Obtaining Optimal<i>k</i>-Cardinality Trees Fast (Q5233508):
Displaying 8 items.
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- A memetic algorithm based on tabu search for \(k\)-cardinality tree problems (Q2794969) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure (Q4291481) (← links)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) (Q5090451) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
