Pages that link to "Item:Q1417576"
From MaRDI portal
The following pages link to Channel assignment on graphs of bounded treewidth (Q1417576):
Displaying 13 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- On the span in channel assignment problems: Bounds, computing and counting (Q1810659) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- Generalized edge-colorings of weighted graphs (Q2798333) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- (Q3466550) (← links)
- (Q3977585) (← links)