On improved exact algorithms for L(2,1)-labeling of graphs
From MaRDI portal
Publication:3000491
DOI10.1007/978-3-642-19222-7_4zbMATH Open1295.05205OpenAlexW2204989461MaRDI QIDQ3000491FDOQ3000491
Authors: Konstanty Junosza-Szaniawski, Paweł Rzążewski 
Publication date: 19 May 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-19222-7_4
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (19)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- Title not available (Why is that?)
- Distance three labelings of trees
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- Determining the \(L(2,1)\)-span in polynomial space
- Determining the \(L(2,1)\)-span in polynomial space
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
- Colorings with few colors: counting, enumeration and combinatorial bounds
- On the number of 2-packings in a connected graph
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
- Algorithmic complexity of proper labeling problems
- Channel assignment via fast zeta transform
- Exact Algorithms for L(2,1)-Labeling of Graphs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Injective \(L(2,1)\)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs
- A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs
This page was built for publication: On improved exact algorithms for \(L(2,1)\)-labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000491)
