2024-11-14T22:06:32Z
https://fit.repo.nii.ac.jp/oai
oai:fit.repo.nii.ac.jp:00000716
2023-05-15T14:01:47Z
256:257:373
Rooted Tree Sequence Problems
Rooted Tree Sequence Problems
TAKAHASHI, Masaya
3325
minium depth
leveled rooted tree
tournament tree
score sequence
optimal and optimum condition
minium depth
leveled rooted tree
tournament tree
score sequence
optimal and optimum condition
application/pdf
論文(Article)
Let D be a directed tree. If deg⁻ (r)=O for some vertex r ED, and deg⁻ (v)=l for any vertex v ED with v ≠ r ,then r is called a root and D is called a rooted tree. A sequence of nonnegative integers S=(s₁, s₂,…， sn）is a rooted tree sequence if there is a rooted tree with vertices V₁, V₂,…， Vn such that deg⁺（vj＝sj for each j = 1, 2,…， n. The rooted tree sequence problem is: Given a sequence of nonnegative integers, determine whether it is a rooted tree sequence or not. In this paper, I consider several variations of the rooted tree sequence problem and give linear time algorithms.
departmental bulletin paper
福岡工業大学
1995-03-15
VoR
application/pdf
福岡工業大学研究論集
2
27
201
211
RESEARCH BULLETIN OF FUKUOKA INSTITUTE OF TECHNOLOGY
02876620
https://fit.repo.nii.ac.jp/record/716/files/27(2)-201.pdf
http://hdl.handle.net/11478/00001680
https://fit.repo.nii.ac.jp/records/716
eng