Timeline for Term for the maximum number of vertices per depth of a rooted tree
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2017 at 10:40 | comment | added | koalo | @ManfredWeis I like the idea, but since it is not so obvious I will use breadth. | |
| Dec 3, 2017 at 14:45 | comment | added | Manfred Weis | @koalo the idea behind it was an analogy to a biological tree with the sun vertically above it; the shadow would then resemble the maximal width; o.k. the analogy is not obvious and has weaknesses, so just ignore my suggestion. | |
| Dec 3, 2017 at 13:47 | vote | accept | koalo | ||
| Dec 3, 2017 at 13:47 | comment | added | koalo | @ManfredWeis I don't get the idea behind "shadow width" :-( | |
| Dec 1, 2017 at 15:14 | comment | added | Manfred Weis | If a new term would acceptable how about "the shadow width" of the tree? | |
| Dec 1, 2017 at 12:56 | answer | added | James Smith | timeline score: 2 | |
| Dec 1, 2017 at 12:39 | comment | added | Ben Barber | I wouldn't object to "width" as an ad hoc usage, but it isn't standard. If the tree were generated by a branching process you might call it the size of the largest generation. | |
| Dec 1, 2017 at 12:37 | history | edited | Ben Barber |
top-level tag
|
|
| Dec 1, 2017 at 11:43 | history | asked | koalo | CC BY-SA 3.0 |