On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
DOI10.1007/978-3-642-11476-2_22zbMATH Open1274.68692OpenAlexW2153934225MaRDI QIDQ3408178FDOQ3408178
Authors: Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks 
Publication date: 24 February 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_22
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
optical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignmentonline matchingmulti-partite graphs
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online Weighted Matching
- Management of multi-queue switches in QoS networks
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- Approximation and Online Algorithms
- Better bounds for minimizing SONET ADMs
- Minimizing ADMs on WDM directed fiber trees
- Optimal Node Routing
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
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)
