Geodesic
Some Provably Hard Crossing Number Problems.
Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 443-460

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : crossing number problems, drawing a graph, pseudolines, arrangement, crossing drawing, polynomial-time algorithm, NP, tight bound 
@article{DCG_1991__6_4_131170,
     author = {D. Bienstock},
     title = {Some {Provably} {Hard} {Crossing} {Number} {Problems.}},
     journal = {Discrete & computational geometry},
     pages = {443--460},
     publisher = {mathdoc},
     volume = {6},
     number = {4},
     year = {1991},
     zbl = {0765.68202},
     url = {http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131170/}
}
TY  - JOUR
AU  - D. Bienstock
TI  - Some Provably Hard Crossing Number Problems.
JO  - Discrete & computational geometry
PY  - 1991
SP  - 443
EP  - 460
VL  - 6
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131170/
ID  - DCG_1991__6_4_131170
ER  - 
%0 Journal Article
%A D. Bienstock
%T Some Provably Hard Crossing Number Problems.
%J Discrete & computational geometry
%D 1991
%P 443-460
%V 6
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131170/
%F DCG_1991__6_4_131170
D. Bienstock. Some Provably Hard Crossing Number Problems.. Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 443-460. http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131170/