Geodesic
On the Complexity of the Planar Slope Number Problem
Journal of graph algorithms and applications, Tome 21 (2017) no. 2, pp. 183-193 Cet article a éte moissonné depuis la source Journal of Graph Algorythms and Applications website

Voir la notice de l'article

The planar slope number of a planar graph $G$ is defined as the minimum number of slopes that is required for a crossing-free straight-line drawing of $G$. We show that determining the planar slope number is hard in the existential theory of the reals. We discuss consequences for drawings that minimize the planar slope number.
DOI : 10.7155/jgaa.00411
Keywords: planar graphs, slope number, existential theory of the reals, complexity, straight-line drawing 
@article{JGAA_2017_21_2_a2,
     author = {Udo Hoffmann},
     title = {On the {Complexity} of the {Planar} {Slope} {Number} {Problem}},
     journal = {Journal of graph algorithms and applications},
     pages = {183--193},
     year = {2017},
     volume = {21},
     number = {2},
     doi = {10.7155/jgaa.00411},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00411/}
}
TY  - JOUR
AU  - Udo Hoffmann
TI  - On the Complexity of the Planar Slope Number Problem
JO  - Journal of graph algorithms and applications
PY  - 2017
SP  - 183
EP  - 193
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00411/
DO  - 10.7155/jgaa.00411
LA  - en
ID  - JGAA_2017_21_2_a2
ER  - 
%0 Journal Article
%A Udo Hoffmann
%T On the Complexity of the Planar Slope Number Problem
%J Journal of graph algorithms and applications
%D 2017
%P 183-193
%V 21
%N 2
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00411/
%R 10.7155/jgaa.00411
%G en
%F JGAA_2017_21_2_a2
Udo Hoffmann. On the Complexity of the Planar Slope Number Problem. Journal of graph algorithms and applications, Tome 21 (2017) no. 2, pp. 183-193. doi: 10.7155/jgaa.00411

Cité par Sources :