i_o-efficient_graph_algorithms

I/O-efficient graph algorithms

Efficient external-memory bisimulation on DAGs.
By George Fletcher, Herman Haverkort, and Jelle Hellings.
In Proc. 31st Conf. ACM Special Interest Group on Management of Data (SIGMOD), pages 553–564, 2012.
text

I/O-optimal algorithms on grid graphs.
By Herman Haverkort.
Computing Research Repository (arXiv.org), 1211.2066, 2012.
text

I/O-efficient algorithms on near-planar graphs.
By Herman Haverkort and Laura Toma.
Journal on Graph Algorithms and Applications, 15(4):503–532, 2011.
text

i_o-efficient_graph_algorithms.txt · Last modified: 2013/01/10 10:49 by 127.0.0.1