Geodesic
An Approach for Mixed Upward Planarization
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 , Tome 7 (2003) no. 2, pp. 203-220.

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

In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. We present a heuristic approach for this problem which provides good quality and reasonable running time in practice, even for large graphs. This planarization method combined with a graph drawing algorithm for upward planar graphs can be seen as a real alternative to the well known Sugiyama algorithm. 
@article{JGAA_2003_7_2_a5,
     author = {Markus Eiglsperger and Michael Kaufmann and Frank Eppinger},
     title = {An {Approach} for {Mixed} {Upward} {Planarization}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {203--220},
     publisher = {mathdoc},
     volume = {7},
     number = {2},
     year = {2003},
     doi = {10.7155/jgaa.00067},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00067/}
}
TY  - JOUR
AU  - Markus Eiglsperger
AU  - Michael Kaufmann
AU  - Frank Eppinger
TI  - An Approach for Mixed Upward Planarization
JO  - Journal of Graph Algorithms and Applications
PY  - 2003
SP  - 203
EP  - 220
VL  - 7
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00067/
DO  - 10.7155/jgaa.00067
LA  - en
ID  - JGAA_2003_7_2_a5
ER  - 
%0 Journal Article
%A Markus Eiglsperger
%A Michael Kaufmann
%A Frank Eppinger
%T An Approach for Mixed Upward Planarization
%J Journal of Graph Algorithms and Applications
%D 2003
%P 203-220
%V 7
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00067/
%R 10.7155/jgaa.00067
%G en
%F JGAA_2003_7_2_a5
Markus Eiglsperger; Michael Kaufmann; Frank Eppinger. An Approach for Mixed Upward Planarization. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001
					, Tome 7 (2003) no. 2, pp. 203-220. doi : 10.7155/jgaa.00067. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00067/

Cité par Sources :