Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs

DOI10.1137/090775440zbMath1237.05168OpenAlexW2018023411MaRDI QIDQ3225135

Xavier Muñoz, Ignasi Sau, Zhentao Li

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090775440

zbMATH Keywords

cubic graphregular graphoptical networksperfect matchinggraph decompositionedge partitiontraffic groomingadd drop multiplexer (ADM)

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

Decomposing subcubic graphs into claws, paths or triangles ⋮ Decomposing Cubic Graphs into Connected Subgraphs of Size Three ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games

This page was built for publication: Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs