Geodesic
Complexity aspects of the computation of the rank of a graph
Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 2.

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

Special issue PRIMA 2013 
@article{DMTCS_2014_16_2_a2,
     author = {Ramos, Igor and Santos, Vin{\'\i}cius F. and Szwarcfiter, Jayme L.},
     title = {Complexity aspects of the computation of the rank of a graph},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {2014},
     doi = {10.46298/dmtcs.2075},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2075/}
}
TY  - JOUR
AU  - Ramos, Igor
AU  - Santos, Vinícius F.
AU  - Szwarcfiter, Jayme L.
TI  - Complexity aspects of the computation of the rank of a graph
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2075/
DO  - 10.46298/dmtcs.2075
LA  - en
ID  - DMTCS_2014_16_2_a2
ER  - 
%0 Journal Article
%A Ramos, Igor
%A Santos, Vinícius F.
%A Szwarcfiter, Jayme L.
%T Complexity aspects of the computation of the rank of a graph
%J Discrete mathematics & theoretical computer science
%D 2014
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2075/
%R 10.46298/dmtcs.2075
%G en
%F DMTCS_2014_16_2_a2
Ramos, Igor; Santos, Vinícius F.; Szwarcfiter, Jayme L. Complexity aspects of the computation of the rank of a graph. Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 2. doi : 10.46298/dmtcs.2075. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2075/

Cité par Sources :