Computing \(L(p, 1)\)-labeling with combined parameters
From MaRDI portal
Publication:2232248
DOI10.1007/978-3-030-68211-8_17OpenAlexW3135417810MaRDI QIDQ2232248
Hirotaka Ono, Kazuma Kawai, Tesshu Hanaka
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2009.10502
Related Items (2)
Computing L(p,1)-Labeling with Combined Parameters ⋮ Computing \(L(p, 1)\)-labeling with combined parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- \(T\)-colorings of graphs: recent results and open problems
- Parameterized complexity of fair deletion problems
- Computing \(L(p, 1)\)-labeling with combined parameters
- Optimal data reduction for graph coloring using low-degree polynomials
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Parameterized complexity of distance labeling and uniform channel assignment problems
- On the \(L(p,1)\)-labelling of graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Integer Programming with a Fixed Number of Variables
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Automata, Languages and Programming
- Hierarchy of Transportation Network Parameters and Hardness Results
- Parameterized algorithms for the happy set problem
- Graph-Theoretic Concepts in Computer Science
- Imbalance parameterized by twin cover revisited
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: Computing \(L(p, 1)\)-labeling with combined parameters
