Channel assignment on graphs of bounded treewidth
From MaRDI portal
Publication:1417576
DOI10.1016/S0012-365X(03)00236-XzbMath1029.05150OpenAlexW2144688537MaRDI QIDQ1417576
Colin J. H. McDiarmid, Bruce A. Reed
Publication date: 5 January 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00236-x
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Parameterized complexity of distance labeling and uniform channel assignment problems ⋮ THE GRAPH-BIN PACKING PROBLEM ⋮ Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs ⋮ Bandwidth consecutive multicolorings of graphs ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ An exact algorithm for the channel assignment problem ⋮ Generalized edge-colorings of weighted graphs ⋮ Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
Cites Work