A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.
Rahman, Md.Saidur; Nakano, Shin-ichi; Nishizeki, Takao
Journal of Graph Algorithms and Applications (1999)
- Volume: 3, Issue: 4, page 31-62
- ISSN: 1526-1719
Access Full Article
top
How to cite
topRahman, Md.Saidur, Nakano, Shin-ichi, and Nishizeki, Takao. "A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.." Journal of Graph Algorithms and Applications 3.4 (1999): 31-62. <http://eudml.org/doc/48534>.
@article{Rahman1999,
author = {Rahman, Md.Saidur, Nakano, Shin-ichi, Nishizeki, Takao},
journal = {Journal of Graph Algorithms and Applications},
keywords = {orthogonal drawing; plane graph; linear-time algorithm},
language = {eng},
number = {4},
pages = {31-62},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.},
url = {http://eudml.org/doc/48534},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Rahman, Md.Saidur
AU - Nakano, Shin-ichi
AU - Nishizeki, Takao
TI - A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.
JO - Journal of Graph Algorithms and Applications
PY - 1999
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 3
IS - 4
SP - 31
EP - 62
LA - eng
KW - orthogonal drawing; plane graph; linear-time algorithm
UR - http://eudml.org/doc/48534
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.