On external-memory planar depth first search.

Arge, Lars; Meyer, Ulrich; Toma, Laura; Zeh, Norbert

Journal of Graph Algorithms and Applications (2003)

  • Volume: 7, Issue: 2, page 105-129
  • ISSN: 1526-1719

How to cite

top

Arge, Lars, et al. "On external-memory planar depth first search.." Journal of Graph Algorithms and Applications 7.2 (2003): 105-129. <http://eudml.org/doc/50434>.

@article{Arge2003,
author = {Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert},
journal = {Journal of Graph Algorithms and Applications},
keywords = {graph algorithms; sparse graphs; embedded planar graphs},
language = {eng},
number = {2},
pages = {105-129},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {On external-memory planar depth first search.},
url = {http://eudml.org/doc/50434},
volume = {7},
year = {2003},
}

TY - JOUR
AU - Arge, Lars
AU - Meyer, Ulrich
AU - Toma, Laura
AU - Zeh, Norbert
TI - On external-memory planar depth first search.
JO - Journal of Graph Algorithms and Applications
PY - 2003
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 7
IS - 2
SP - 105
EP - 129
LA - eng
KW - graph algorithms; sparse graphs; embedded planar graphs
UR - http://eudml.org/doc/50434
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.