@article{oai:niigata-u.repo.nii.ac.jp:00001926,
 author = {Watanabe, Kaoru and Sengoku, Masakazu and Tamura, Hiroshi and Yamaguchi, Yoshio},
 issue = {3},
 journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences, IEICE transactions on fundamentals of electronics, communications and computer sciences},
 month = {Mar},
 note = {Problems of realizing a vertex-weighted tree with a given weighted tranamission number sequence are discussed in this paper. First we consider properties of the weighted transmission number sequence of a vertex-weighted tree. Let S be a sequence whose terms are pairs of a non-negative integer and a positive integer. The problem determining whether S is the weighted transmission number sequence of a vertex-weighted tree or not, is called w-TNS. We prove that w-TNS is NP-complete, and we show an algorithm using backtracking. This algorithm always gives a correct solution. And, if each transmission number of S is different to the others, then the time complexity of this is only 0( ∣ S ∣ 2).Next we consider the d2-transmission number sequence so that the distance function is defined by a special convex function.},
 pages = {527--533},
 title = {Realization Problems of a Tree with a Transmission Number Sequence},
 volume = {E77-A},
 year = {1994}
}