Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)

Authors:
Jiří Fiala;Petr A. Golovach;Jan Kratochvíl
Affiliations:
Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic;Institutt for informatikk, Universitetet i Bergen, Norway;Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 6

Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
L(j,k)-labelling and maximum ordering-degrees for trees

Discrete Applied Mathematics
The L(h,1,1)-labelling problem for trees

European Journal of Combinatorics
Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science
L(2, 1, 1)-labeling is NP-complete for trees

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ...