A Linear Time Algorithm for L(2,1)-Labeling of Trees
From MaRDI portal
Publication:3639233
DOI10.1007/978-3-642-04128-0_4zbMath1256.05234OpenAlexW2153418810MaRDI QIDQ3639233
Toshimasa Ishii, Hirotaka Ono, Yushi Uno, Toru Hasunuma
Publication date: 29 October 2009
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-04128-0_4
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ \(L(2, 1)\)-labeling of circulant graphs ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ L(3,1)-labeling of circulant graphs ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ The \((p,q)\)-total labeling problem for trees ⋮ Injective colorings with arithmetic constraints ⋮ Distance three labelings of trees ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
This page was built for publication: A Linear Time Algorithm for L(2,1)-Labeling of Trees
