Geodesic
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
Discrete mathematics & theoretical computer science, Tome 14 (2012) no. 1.

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

Discrete Algorithms 
@article{DMTCS_2012_14_1_a4,
     author = {Lonc, Zbigniew and Naroski, Pawel},
     title = {A linear time algorithm for finding an {Euler} walk in a strongly connected 3-uniform hypergraph},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2012},
     doi = {10.46298/dmtcs.568},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.568/}
}
TY  - JOUR
AU  - Lonc, Zbigniew
AU  - Naroski, Pawel
TI  - A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
JO  - Discrete mathematics & theoretical computer science
PY  - 2012
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.568/
DO  - 10.46298/dmtcs.568
LA  - en
ID  - DMTCS_2012_14_1_a4
ER  - 
%0 Journal Article
%A Lonc, Zbigniew
%A Naroski, Pawel
%T A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
%J Discrete mathematics & theoretical computer science
%D 2012
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.568/
%R 10.46298/dmtcs.568
%G en
%F DMTCS_2012_14_1_a4
Lonc, Zbigniew; Naroski, Pawel. A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. Discrete mathematics & theoretical computer science, Tome 14 (2012) no. 1. doi : 10.46298/dmtcs.568. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.568/

Cité par Sources :