Geodesic
On the complexity of covering nodes by K node-disjoint cycles
Portugaliae mathematica, Tome 45 (1988) no. 1, pp. 25-27

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Keywords: cycle covering, NP-completeness, undirected graph 
@article{PORMA_1988__45_1_115605,
     author = {Cerdeira, J. Orestes},
     title = {On the complexity of covering nodes by {K} node-disjoint cycles},
     journal = {Portugaliae mathematica},
     pages = {25--27},
     publisher = {mathdoc},
     volume = {45},
     number = {1},
     year = {1988},
     mrnumber = {0952795},
     zbl = {0661.68037},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/PORMA_1988__45_1_115605/}
}
TY  - JOUR
AU  - Cerdeira, J. Orestes
TI  - On the complexity of covering nodes by K node-disjoint cycles
JO  - Portugaliae mathematica
PY  - 1988
SP  - 25
EP  - 27
VL  - 45
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PORMA_1988__45_1_115605/
LA  - en
ID  - PORMA_1988__45_1_115605
ER  - 
%0 Journal Article
%A Cerdeira, J. Orestes
%T On the complexity of covering nodes by K node-disjoint cycles
%J Portugaliae mathematica
%D 1988
%P 25-27
%V 45
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PORMA_1988__45_1_115605/
%G en
%F PORMA_1988__45_1_115605
Cerdeira, J. Orestes. On the complexity of covering nodes by K node-disjoint cycles. Portugaliae mathematica, Tome 45 (1988) no. 1, pp. 25-27. http://geodesic.mathdoc.fr/item/PORMA_1988__45_1_115605/