An Approach for Mixed Upward Planarization (2003)
Cached
Download Links
- [www.cs.brown.edu]
- [www.emis.de]
- [www.emis.math.ca]
- [www-pr.informatik.uni-tuebingen.de]
- DBLP
Other Repositories/Bibliography
by
Markus Eiglsperger
,
Frank Eppinger
,
Michael Kaufmann
| Venue: | In Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Eiglsperger03anapproach,
author = {Markus Eiglsperger and Frank Eppinger and Michael Kaufmann},
title = {An Approach for Mixed Upward Planarization},
booktitle = {In Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01},
year = {2003},
pages = {352--364},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
