Geodesic
On the complexity of the balanced vertex ordering problem
Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 1.

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

Graphs and Algorithms 
@article{DMTCS_2007_9_1_a1,
     author = {K\'ara, Jan and Kratochvil, Jan and Wood, David R.},
     title = {On the complexity of the balanced vertex ordering problem},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2007},
     doi = {10.46298/dmtcs.383},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.383/}
}
TY  - JOUR
AU  - Kára, Jan
AU  - Kratochvil, Jan
AU  - Wood, David R.
TI  - On the complexity of the balanced vertex ordering problem
JO  - Discrete mathematics & theoretical computer science
PY  - 2007
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.383/
DO  - 10.46298/dmtcs.383
LA  - en
ID  - DMTCS_2007_9_1_a1
ER  - 
%0 Journal Article
%A Kára, Jan
%A Kratochvil, Jan
%A Wood, David R.
%T On the complexity of the balanced vertex ordering problem
%J Discrete mathematics & theoretical computer science
%D 2007
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.383/
%R 10.46298/dmtcs.383
%G en
%F DMTCS_2007_9_1_a1
Kára, Jan; Kratochvil, Jan; Wood, David R. On the complexity of the balanced vertex ordering problem. Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 1. doi : 10.46298/dmtcs.383. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.383/

Cité par Sources :