Geodesic
Building Blocks of Upward Planar Digraphs
Journal of Graph Algorithms and Applications, Tome 11 (2007) no. 1, pp. 3-44.

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

The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross. In this paper we reduce the problem of testing a digraph for upward planarity to the problem of testing if its blocks admit upward planar drawings with certain properties. We also show how to test if a block of a digraph admits an upward planar drawing with the aforementioned properties. 
@article{JGAA_2007_11_1_a0,
     author = {Patrick Healy and Karol Lynch},
     title = {Building {Blocks} of {Upward} {Planar} {Digraphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {3--44},
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {2007},
     doi = {10.7155/jgaa.00135},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00135/}
}
TY  - JOUR
AU  - Patrick Healy
AU  - Karol Lynch
TI  - Building Blocks of Upward Planar Digraphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2007
SP  - 3
EP  - 44
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00135/
DO  - 10.7155/jgaa.00135
LA  - en
ID  - JGAA_2007_11_1_a0
ER  - 
%0 Journal Article
%A Patrick Healy
%A Karol Lynch
%T Building Blocks of Upward Planar Digraphs
%J Journal of Graph Algorithms and Applications
%D 2007
%P 3-44
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00135/
%R 10.7155/jgaa.00135
%G en
%F JGAA_2007_11_1_a0
Patrick Healy; Karol Lynch. Building Blocks of Upward Planar Digraphs. Journal of Graph Algorithms and Applications, Tome 11 (2007) no. 1, pp. 3-44. doi : 10.7155/jgaa.00135. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00135/

Cité par Sources :