Definition:Arborescence/Also known as
Jump to navigation
Jump to search
Definition
An arborescence of root $r$ can be referred to as an an $r$-arborescence, or just an arborescence.
Various sources use different terms, for example:
- Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms calls an arborescence an oriented tree
- John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation calls an arborescence an ordered, directed tree.
Sources
- 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.2$ Graphs and Trees: Trees