Page
%P
-
Chapter and Conference Paper
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique ...