Geodesic
A space optimal algorithm for enumerating spanning trees of a connected graph
Novi Sad Journal of Mathematics, Tome 21 (1991) no. 1 Cet article a éte moissonné depuis la source Novi sad journal of mathematics website

Voir la notice de l'article

@article{NSJOM_1991_21_1a_4,
     author = {Novak 

 Ladislav and Karad\v{z}i\'c \v{Z}arko and Acketa Dragan M.},
     title = {A space optimal algorithm 

 for enumerating spanning trees of a connected graph},
     journal = {Novi Sad Journal of Mathematics},
     pages = {39-56},
     year = {1991},
     volume = {21},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/NSJOM_1991_21_1a_4/}
}
TY  - JOUR
AU  - Novak 

 Ladislav
AU  - Karadžić Žarko
AU  - Acketa Dragan M.
TI  - A space optimal algorithm 

 for enumerating spanning trees of a connected graph
JO  - Novi Sad Journal of Mathematics
PY  - 1991
SP  - 39
EP  - 56
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/NSJOM_1991_21_1a_4/
ID  - NSJOM_1991_21_1a_4
ER  - 
%0 Journal Article
%A Novak 

 Ladislav
%A Karadžić Žarko
%A Acketa Dragan M.
%T A space optimal algorithm 

 for enumerating spanning trees of a connected graph
%J Novi Sad Journal of Mathematics
%D 1991
%P 39-56
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/NSJOM_1991_21_1a_4/
%F NSJOM_1991_21_1a_4
Novak 

 Ladislav; Karadžić Žarko; Acketa Dragan M. A space optimal algorithm 

 for enumerating spanning trees of a connected graph. Novi Sad Journal of Mathematics, Tome 21 (1991) no. 1. http://geodesic.mathdoc.fr/item/NSJOM_1991_21_1a_4/