Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Edge-partitioning regular graphs for ring traffic grooming with a priori placement od the ADMs

Autor
Muñoz, X.; Zhentao, L.; Sau, I.
Tipus d'activitat
Article en revista
Revista
SIAM journal on discrete mathematics
Data de publicació
2011
Volum
25
Número
4
Pàgina inicial
1490
Pàgina final
1505
DOI
https://doi.org/10.1137/090775440 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/14389 Obrir en finestra nova
Resum
We study the following graph partitioning problem: Given two positive integers C and Δ, find the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ can be partitioned into subgraphs with at most C edges and each vertex appears in at most M(C,Δ) subgraphs. This problem is naturally motivated by traffic grooming, which is a major issue in optical networks. Namely, we introduce a new pseudodynamic model of traffic grooming in unidirectional rings, in which the a...
Citació
Muñoz, X.; Zhentao, L.; Sau, I. Edge-partitioning regular graphs for ring traffic grooming with a priori placement od the ADMs. "SIAM journal on discrete mathematics", 2011, vol. 25, núm. 4, p. 1490-1505.
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius