Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh. I/O and Space-Efficient Path Traversal in Planar Graphs. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 1175-1184, Springer, 2009. [doi]
@inproceedings{DillabaughHMZ09, title = {I/O and Space-Efficient Path Traversal in Planar Graphs}, author = {Craig Dillabaugh and Meng He and Anil Maheshwari and Norbert Zeh}, year = {2009}, doi = {10.1007/978-3-642-10631-6_118}, url = {http://dx.doi.org/10.1007/978-3-642-10631-6_118}, tags = {traversal, planar graph, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/DillabaughHMZ09}, cites = {0}, citedby = {0}, pages = {1175-1184}, booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra}, volume = {5878}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-10630-9}, }