Synthesis of a Communication Net
From MaRDI portal
Cited in
(6)- Minimum block containing a given graph
- Optimization of communication nets with switching
- The sensitivity of a traffic network
- On the robustness of potential-based flow networks
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- New algorithms and lower bounds for all-pairs max-flow in undirected graphs
This page was built for publication: Synthesis of a Communication Net
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3272781)