New lower bounds for orthogonal drawings.

Biedl, Therese C.

Journal of Graph Algorithms and Applications (1998)

  • Volume: 2, page Paper No. 7, 31 p.-Paper No. 7, 31 p.
  • ISSN: 1526-1719

How to cite

top

Biedl, Therese C.. "New lower bounds for orthogonal drawings.." Journal of Graph Algorithms and Applications 2 (1998): Paper No. 7, 31 p.-Paper No. 7, 31 p.. <http://eudml.org/doc/48188>.

@article{Biedl1998,
author = {Biedl, Therese C.},
journal = {Journal of Graph Algorithms and Applications},
keywords = {embedding; orthogonal graph drawings; lower bounds},
language = {eng},
pages = {Paper No. 7, 31 p.-Paper No. 7, 31 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {New lower bounds for orthogonal drawings.},
url = {http://eudml.org/doc/48188},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Biedl, Therese C.
TI - New lower bounds for orthogonal drawings.
JO - Journal of Graph Algorithms and Applications
PY - 1998
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 2
SP - Paper No. 7, 31 p.
EP - Paper No. 7, 31 p.
LA - eng
KW - embedding; orthogonal graph drawings; lower bounds
UR - http://eudml.org/doc/48188
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.