An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
From MaRDI portal
Publication:3512458
DOI10.1007/978-3-540-69903-3_18zbMath1155.05337OpenAlexW171866752MaRDI QIDQ3512458
Hirotaka Ono, Toru Hasunuma, Yushi Uno, Toshimasa Ishii
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_18
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Exact algorithms for \(L(2,1)\)-labeling of graphs, (2,1)-total labelling of trees with sparse vertices of maximum degree
Cites Work
- \(T\)-colorings of graphs: recent results and open problems
- On \(L(d,1)\)-labelings of graphs
- The \(L(2,1)\)-labelling of trees
- A survey on labeling graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Automata, Languages and Programming
- Fixed-parameter complexity of \(\lambda\)-labelings