Reingold-Tilford algorithm

English

Etymology

Introduced in a 1981 paper by Edward Reingold and John Tilford.

Noun

Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)Category:English lemmas#REINGOLDTILFORDALGORITHMCategory:English nouns#REINGOLDTILFORDALGORITHMCategory:English countable nouns#REINGOLDTILFORDALGORITHMCategory:English multiword terms#REINGOLDTILFORDALGORITHMCategory:English entries with incorrect language header#REINGOLDTILFORDALGORITHMCategory:Pages with entries#REINGOLD-TILFORD%20ALGORITHMCategory:Pages with 1 entry#REINGOLD-TILFORD%20ALGORITHM

  1. (computing theoryCategory:en:Theory of computing#REINGOLDTILFORDALGORITHM) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
Category:English eponyms#REINGOLDTILFORDALGORITHM
Category:English countable nouns Category:English eponyms Category:English lemmas Category:English multiword terms Category:English nouns Category:Pages with 1 entry Category:Pages with entries Category:en:Theory of computing