Geodesic
Orthogonal-Ordering Constraints are Tough
Journal of Graph Algorithms and Applications, Tome 17 (2013) no. 1, pp. 1-10.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We show that rectilinear graph drawing, the core problem of bend-minimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.
DOI : 10.7155/jgaa.00281
Keywords: graph drawing, orthogonal ordering constraints, straight-line drawing 
@article{JGAA_2013_17_1_a0,
     author = {Ulrik Brandes and Barbara Pampel},
     title = {Orthogonal-Ordering {Constraints} are {Tough}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {1--10},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {2013},
     doi = {10.7155/jgaa.00281},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00281/}
}
TY  - JOUR
AU  - Ulrik Brandes
AU  - Barbara Pampel
TI  - Orthogonal-Ordering Constraints are Tough
JO  - Journal of Graph Algorithms and Applications
PY  - 2013
SP  - 1
EP  - 10
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00281/
DO  - 10.7155/jgaa.00281
LA  - en
ID  - JGAA_2013_17_1_a0
ER  - 
%0 Journal Article
%A Ulrik Brandes
%A Barbara Pampel
%T Orthogonal-Ordering Constraints are Tough
%J Journal of Graph Algorithms and Applications
%D 2013
%P 1-10
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00281/
%R 10.7155/jgaa.00281
%G en
%F JGAA_2013_17_1_a0
Ulrik Brandes; Barbara Pampel. Orthogonal-Ordering Constraints are Tough. Journal of Graph Algorithms and Applications, Tome 17 (2013) no. 1, pp. 1-10. doi : 10.7155/jgaa.00281. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00281/

Cité par Sources :