Title of article
Processing Huge Graphs with Stxxl
Author/Authors
Dementiev، نويسنده , , Roman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
2
From page
37
To page
38
Abstract
We introduce a notion of a suballowable sequence of permutations and prove a few combinatorial and geometric results on such sequences.
Keywords
graph algorithms , External memory , algorithm engineering , large data sets , I/O-efficient algorithms
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454337
Link To Document