Pages that link to "Item:Q3546347"
From MaRDI portal
The following pages link to (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347):
Displaying 18 items.
- The Klein bottle and multicommodity flows (Q920100) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- The fluid mechanics of liquid democracy (Q2190393) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)
- Simple undirected two-commodity integral flow with a unitary demand (Q2413185) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- Traffic engineering of management flows by link augmentations on confluent trees (Q2471695) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks (Q5084608) (← links)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
