Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks

DOI10.1007/978-3-540-75142-7_33zbMath1145.68335OpenAlexW1501151346MaRDI QIDQ3523227

Prudence W. H. Wong, Shmuel Zaks, Mordechai Shalom

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_33

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology

This page was built for publication: Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks