Pages that link to "Item:Q925137"
From MaRDI portal
The following pages link to An approximate max-Steiner-tree-packing min-Steiner-cut theorem (Q925137):
Displaying 14 items.
- Packing Steiner trees (Q273179) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- Hamilton cycles in line graphs of 3-hypergraphs (Q2144607) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)
- On the Edge-Erdős–Pósa Property of Ladders (Q6489358) (← links)
