This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Combinatorial Algorithm for Solving Covering Problems
February 1973 (vol. 22 no. 2)
pp. 218-220
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.
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, Feb. 1973, doi:10.1109/T-C.1973.223690
Usage of this product signifies your acceptance of the Terms of Use.