On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
From MaRDI portal
Publication:3408178
Recommendations
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
- Optimal on-line colorings for minimizing the number of ADMs in optical networks
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- Traffic Grooming in Star Networks via Matching Techniques
- scientific article; zbMATH DE number 2080982
Cites work
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- scientific article; zbMATH DE number 742966 (Why is no real title available?)
- Approximation and Online Algorithms
- Better bounds for minimizing SONET ADMs
- Management of multi-queue switches in QoS networks
- Minimizing ADMs on WDM directed fiber trees
- Online Weighted Matching
- Optimal Node Routing
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
Cited in
(1)
This page was built for publication: On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408178)