Embedding vertices at points: Few bends suffice for planar graphs.
Kaufmann, Michael; Wiese, Roland
Journal of Graph Algorithms and Applications (2002)
- Volume: 6, Issue: 1, page 115-129
- ISSN: 1526-1719
Access Full Article
topHow to cite
topKaufmann, Michael, and Wiese, Roland. "Embedding vertices at points: Few bends suffice for planar graphs.." Journal of Graph Algorithms and Applications 6.1 (2002): 115-129. <http://eudml.org/doc/49574>.
@article{Kaufmann2002,
author = {Kaufmann, Michael, Wiese, Roland},
journal = {Journal of Graph Algorithms and Applications},
keywords = {plane graphs},
language = {eng},
number = {1},
pages = {115-129},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Embedding vertices at points: Few bends suffice for planar graphs.},
url = {http://eudml.org/doc/49574},
volume = {6},
year = {2002},
}
TY - JOUR
AU - Kaufmann, Michael
AU - Wiese, Roland
TI - Embedding vertices at points: Few bends suffice for planar graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2002
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 6
IS - 1
SP - 115
EP - 129
LA - eng
KW - plane graphs
UR - http://eudml.org/doc/49574
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.