A note on the NP-hardness of two matching problems in induced subgrids
Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2.

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

Graph Theory
@article{DMTCS_2013_15_2_a12,
     author = {Demange, Marc and Ekim, T{\i}naz},
     title = {A note on the {NP-hardness} of two matching problems in induced subgrids},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {2013},
     doi = {10.46298/dmtcs.606},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.606/}
}
TY  - JOUR
AU  - Demange, Marc
AU  - Ekim, Tınaz
TI  - A note on the NP-hardness of two matching problems in induced subgrids
JO  - Discrete mathematics & theoretical computer science
PY  - 2013
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.606/
DO  - 10.46298/dmtcs.606
LA  - en
ID  - DMTCS_2013_15_2_a12
ER  - 
%0 Journal Article
%A Demange, Marc
%A Ekim, Tınaz
%T A note on the NP-hardness of two matching problems in induced subgrids
%J Discrete mathematics & theoretical computer science
%D 2013
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.606/
%R 10.46298/dmtcs.606
%G en
%F DMTCS_2013_15_2_a12
Demange, Marc; Ekim, Tınaz. A note on the NP-hardness of two matching problems in induced subgrids. Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2. doi : 10.46298/dmtcs.606. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.606/

Cité par Sources :