Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68080OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716789

Jiří Fiala, Petr A. Golovach, Jan Kratochvíl

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (25)

An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees ⋮ Computing L(p,1)-Labeling with Combined Parameters ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ Parameterized complexity of distance labeling and uniform channel assignment problems ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs ⋮ Distance Constrained Labelings of Trees ⋮ Tangle bases: Revisited ⋮ Distance three labelings of trees ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees ⋮ Determining the \(L(2,1)\)-span in polynomial space ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon ⋮ \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Comparing universal covers in polynomial time ⋮ \(L(2,1)\)-labeling for brick product graphs ⋮ Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems ⋮ Labeling bipartite permutation graphs with a condition at distance two ⋮ Equitable colorings of bounded treewidth graphs

This page was built for publication: Automata, Languages and Programming