Geodesic
I/O-Optimal Algorithms for Outerplanar Graphs
Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 47-87.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing an ε-separator of size O(1/ε) take O(scan(N)) I/Os on embedded outerplanar graphs. We also show that it takes O(sort(N)) I/Os to test whether a given graph is outerplanar and to compute an outerplanar embedding of an outerplanar graph, thereby providing O(sort(N))-I/O algorithms for the above problems if no embedding of the graph is given. As all these problems have linear-time algorithms in internal memory, a simple simulation technique can be used to improve the I/O-complexity of our algorithms from O(sort(N)) to O(perm(N)). We prove matching lower bounds for embedding, breadth-first search, depth-first search, and single-source shortest paths if no embedding is given. Our algorithms for the above problems use a simple linear-I/O time-forward processing algorithm for rooted trees whose vertices are stored in preorder. 
@article{JGAA_2004_8_1_a4,
     author = {Anil Maheshwari and Norbert Zeh},
     title = {I/O-Optimal {Algorithms} for {Outerplanar} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {47--87},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {2004},
     doi = {10.7155/jgaa.00082},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00082/}
}
TY  - JOUR
AU  - Anil Maheshwari
AU  - Norbert Zeh
TI  - I/O-Optimal Algorithms for Outerplanar Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2004
SP  - 47
EP  - 87
VL  - 8
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00082/
DO  - 10.7155/jgaa.00082
LA  - en
ID  - JGAA_2004_8_1_a4
ER  - 
%0 Journal Article
%A Anil Maheshwari
%A Norbert Zeh
%T I/O-Optimal Algorithms for Outerplanar Graphs
%J Journal of Graph Algorithms and Applications
%D 2004
%P 47-87
%V 8
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00082/
%R 10.7155/jgaa.00082
%G en
%F JGAA_2004_8_1_a4
Anil Maheshwari; Norbert Zeh. I/O-Optimal Algorithms for Outerplanar Graphs. Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 47-87. doi : 10.7155/jgaa.00082. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00082/

Cité par Sources :