@article{Khachaturyan_2021, title={Necessary Conditions for Optimal Permissible Placement by the Height of the Transitive Directed Tree with One Root}, volume={36}, url={http://mpcs.sci.am/index.php/mpcs/article/view/272}, abstractNote={<p>In the graph theory the problem of the minimum placement of graph by the height, which is similarly formulated in [2] (the problem of minimum cut arrangement of graph), is known. The problem is NP-complete [3]. In the present paper a partial case of this problem, i.e. the problem of optimal permissible placement by the height of the transitive directed tree with one root (which is a such transitive directed graph, the arc base of which forms a directed tree with one root), is formulated. In this paper some new concepts are introduced and necessary conditions for optimal solving of the new formulated problem are given.</p>}, journal={Mathematical Problems of Computer Science}, author={Khachaturyan, Armen}, year={2021}, month={Dec.}, pages={104–114} }