I/O-optimal algorithms for outerplanar graphs.

Maheshwari, Anil; Zeh, Norbert

Journal of Graph Algorithms and Applications (2004)

  • Volume: 8, Issue: 1, page 47-87
  • ISSN: 1526-1719

How to cite

top

Maheshwari, Anil, and Zeh, Norbert. "I/O-optimal algorithms for outerplanar graphs.." Journal of Graph Algorithms and Applications 8.1 (2004): 47-87. <http://eudml.org/doc/52455>.

@article{Maheshwari2004,
author = {Maheshwari, Anil, Zeh, Norbert},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {1},
pages = {47-87},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {I/O-optimal algorithms for outerplanar graphs.},
url = {http://eudml.org/doc/52455},
volume = {8},
year = {2004},
}

TY - JOUR
AU - Maheshwari, Anil
AU - Zeh, Norbert
TI - I/O-optimal algorithms for outerplanar graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2004
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 8
IS - 1
SP - 47
EP - 87
LA - eng
UR - http://eudml.org/doc/52455
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.