Pages that link to "Item:Q4962687"
From MaRDI portal
The following pages link to Packing element-disjoint steiner trees (Q4962687):
Displaying 6 items.
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
- Algorithms – ESA 2004 (Q5464577) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)