Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems

DOI10.1007/978-3-319-42634-1_6zbMath1476.68207arXiv1507.00640OpenAlexW2499245161WikidataQ62044474 ScholiaQ62044474MaRDI QIDQ2817849

Jan Kratochvíl, Jiří Fiala, Dušan Knop, Tomáš Gavenčiak, Martin Koutecký

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.00640

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Iterated Type Partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• The NLC-width and clique-width for powers of graphs of bounded tree-width
• An application of simultaneous diophantine approximation in combinatorial optimization
• \(k\)-NLC graphs and polynomial algorithms
• Channel assignment on graphs of bounded treewidth
• Algorithmic meta-theorems for restrictions of treewidth
• Upper bounds to the clique width of graphs
• Parameterized Algorithms for Modular-Width
• Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
• Integer Programming with a Fixed Number of Variables
• Intractability of Clique-Width Parameterizations
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• On the Relationship Between Clique-Width and Treewidth
• Automata, Languages and Programming
• The Channel Assignment Problem with Variable Weights
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems