Pages that link to "Item:Q2375957"
From MaRDI portal
The following pages link to A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957):
Displaying 14 items.
- A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
- On the complexity of labeled oriented trees (Q968053) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
- On radio connection number of graphs (Q2416954) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes (Q3523216) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
- A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters (Q6627041) (← links)
