Next: Experiments and Results
Up: Graceful Labeling
Previous: Special Labeling
The general trees are more difficult to label, but using
the algorithm that we developed and refined, we are able to
efficiently find graceful labelings for many trees. It is implemented
as two procedures,
and
.
![\begin{algorithm}
% latex2html id marker 236
[ht!]
\caption{$\mathit{Label}(G)$...
...ng
\ELSE
\STATE unlabel $v$
\ENDIF
\ENDFOR
\end{algorithmic}\end{algorithm}](img74.png)
![\begin{algorithm}
% latex2html id marker 244
[ht!]
\caption{$\mathit{RecursiveL...
...unlabel $q$
\ENDIF
\ENDFOR
\ENDFOR
\ENDFOR
\end{algorithmic}\end{algorithm}](img75.png)
Joshua Taylor
2005-04-27