de la Torre, Pilar; Greenlaw, Raymond; Schäffer, Alejandro A. Optimal edge ranking of trees in polynomial time. (English) Zbl 0801.68129 Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 138-144 (1993). Cited in 4 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68Q25 Analysis of algorithms and problem complexity 05C78 Graph labelling (graceful graphs, bandwidth, etc.) 05C05 Trees Keywords:graph labeling; polynomial-time algorithm; optimal edge ranking; \({\mathcal N}{\mathcal C}\) algorithm; \({\mathcal P}\)-complete PDF BibTeX XML Cite \textit{P. de la Torre} et al., in: Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 138--144 (1993; Zbl 0801.68129) OpenURL