Pages that link to "Item:Q5716789"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716789):
Displaying 26 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters (Q6627041) (← links)
