Fast Exact Algorithm for L(2,1)-Labeling of Graphs
From MaRDI portal
Publication:3010388
DOI10.1007/978-3-642-20877-5_9zbMath1333.05292MaRDI QIDQ3010388
Jan Kratochvíl, Mathieu Liedloff, Konstanty Junosza-Szaniawski, Paweł Rzążewski, Peter Rossmanith
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_9
68Q25: Analysis of algorithms and problem complexity
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Fast exact algorithm for \(L(2,1)\)-labeling of graphs, Colorings with few colors: counting, enumeration and combinatorial bounds
Cites Work
- Unnamed Item
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Exact exponential algorithms.
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Graph labellings with variable weights, a survey
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- A survey on labeling graphs with a condition at distance two
- Gaussian elimination is not optimal
- On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
- Exact Algorithms for L(2,1)-Labeling of Graphs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- 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
- Automata, Languages and Programming
- The Channel Assignment Problem with Variable Weights
- Fixed-parameter complexity of \(\lambda\)-labelings
