Geodesic
Computing the number of h-edge spanning forests in complete bipartite graphs
Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1.

Voir la notice de l'article provenant de la source Episciences

Analysis of Algorithms 
@article{DMTCS_2014_16_1_a4,
     author = {Stones, Rebecca},
     title = {Computing the number of h-edge spanning forests in complete bipartite graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2014},
     doi = {10.46298/dmtcs.1248},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1248/}
}
TY  - JOUR
AU  - Stones, Rebecca
TI  - Computing the number of h-edge spanning forests in complete bipartite graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1248/
DO  - 10.46298/dmtcs.1248
LA  - en
ID  - DMTCS_2014_16_1_a4
ER  - 
%0 Journal Article
%A Stones, Rebecca
%T Computing the number of h-edge spanning forests in complete bipartite graphs
%J Discrete mathematics & theoretical computer science
%D 2014
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1248/
%R 10.46298/dmtcs.1248
%G en
%F DMTCS_2014_16_1_a4
Stones, Rebecca. Computing the number of h-edge spanning forests in complete bipartite graphs. Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1. doi : 10.46298/dmtcs.1248. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1248/

Cité par Sources :