Some Provably Hard Crossing Number Problems.
Discrete & computational geometry (1991)
- Volume: 6, Issue: 5, page 443-460
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topBienstock, D.. "Some Provably Hard Crossing Number Problems.." Discrete & computational geometry 6.5 (1991): 443-460. <http://eudml.org/doc/131170>.
@article{Bienstock1991,
author = {Bienstock, D.},
journal = {Discrete & computational geometry},
keywords = {crossing number problems; drawing a graph; pseudolines; arrangement; crossing drawing; polynomial-time algorithm; NP; tight bound},
number = {5},
pages = {443-460},
title = {Some Provably Hard Crossing Number Problems.},
url = {http://eudml.org/doc/131170},
volume = {6},
year = {1991},
}
TY - JOUR
AU - Bienstock, D.
TI - Some Provably Hard Crossing Number Problems.
JO - Discrete & computational geometry
PY - 1991
VL - 6
IS - 5
SP - 443
EP - 460
KW - crossing number problems; drawing a graph; pseudolines; arrangement; crossing drawing; polynomial-time algorithm; NP; tight bound
UR - http://eudml.org/doc/131170
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.