Diskretnaya Matematika, Tome 9 (1997) no. 1, pp. 147-152
Citer cet article
E. E. Egorov. On the minimal packing of a tree with fixed vertices. Diskretnaya Matematika, Tome 9 (1997) no. 1, pp. 147-152. http://geodesic.mathdoc.fr/item/DM_1997_9_1_a11/
@article{DM_1997_9_1_a11,
author = {E. E. Egorov},
title = {On the minimal packing of a tree with fixed vertices},
journal = {Diskretnaya Matematika},
pages = {147--152},
year = {1997},
volume = {9},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1997_9_1_a11/}
}
TY - JOUR
AU - E. E. Egorov
TI - On the minimal packing of a tree with fixed vertices
JO - Diskretnaya Matematika
PY - 1997
SP - 147
EP - 152
VL - 9
IS - 1
UR - http://geodesic.mathdoc.fr/item/DM_1997_9_1_a11/
LA - ru
ID - DM_1997_9_1_a11
ER -
%0 Journal Article
%A E. E. Egorov
%T On the minimal packing of a tree with fixed vertices
%J Diskretnaya Matematika
%D 1997
%P 147-152
%V 9
%N 1
%U http://geodesic.mathdoc.fr/item/DM_1997_9_1_a11/
%G ru
%F DM_1997_9_1_a11
The problem of minimal packing of a tree onto a segment is considered. It is known that for trees with unfixed vertices it can be solved in polynomial time. Here it is established that this problem is NP-complete if some vertices of a tree are fixed.
