DocumentCode :
1112513
Title :
A Combinatorial Algorithm for Solving Covering Problems
Author :
Tomescu, I.
Issue :
2
fYear :
1973
Firstpage :
218
Lastpage :
220
Abstract :
In this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed.
Keywords :
Chromatic number, cover, directed rooted tree, partition.; Algorithm design and analysis; Mathematics; Partitioning algorithms; Tree graphs; Chromatic number, cover, directed rooted tree, partition.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1973.223690
Filename :
1672283
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1112513