Geodesic
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 2.

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

Graphs and Algorithms 
@article{DMTCS_2011_13_2_a6,
     author = {Person, Yury and Schacht, Mathias},
     title = {An expected polynomial time algorithm for coloring 2-colorable 3-graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2011},
     doi = {10.46298/dmtcs.558},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.558/}
}
TY  - JOUR
AU  - Person, Yury
AU  - Schacht, Mathias
TI  - An expected polynomial time algorithm for coloring 2-colorable 3-graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.558/
DO  - 10.46298/dmtcs.558
LA  - en
ID  - DMTCS_2011_13_2_a6
ER  - 
%0 Journal Article
%A Person, Yury
%A Schacht, Mathias
%T An expected polynomial time algorithm for coloring 2-colorable 3-graphs
%J Discrete mathematics & theoretical computer science
%D 2011
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.558/
%R 10.46298/dmtcs.558
%G en
%F DMTCS_2011_13_2_a6
Person, Yury; Schacht, Mathias. An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 2. doi : 10.46298/dmtcs.558. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.558/

Cité par Sources :