The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1973 vol.22)
pp: 218-220
I. Tomescu , Department of Mathematics, University of Bucharest
ABSTRACT
In this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed.
INDEX TERMS
Chromatic number, cover, directed rooted tree, partition.
CITATION
I. Tomescu, "A Combinatorial Algorithm for Solving Covering Problems", IEEE Transactions on Computers, vol.22, no. 2, pp. 218-220, February 1973, doi:10.1109/T-C.1973.223690
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool