Issue No. 02 - February (1973 vol. 22)
I. Tomescu , Department of Mathematics, University of Bucharest
In this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed.
Chromatic number, cover, directed rooted tree, partition.
I. Tomescu, "A Combinatorial Algorithm for Solving Covering Problems," in IEEE Transactions on Computers, vol. 22, no. , pp. 218-220, 1973.