scholarly journals Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

2016 ◽  
Vol 1 (1) ◽  
Author(s):  
Benjamin Schiller ◽  
Clemens Deusser ◽  
Jeronimo Castrillon ◽  
Thorsten Strufe
Author(s):  
Tomasz Kociumaka ◽  
Jakub Radoszewski ◽  
Wojciech Rytter ◽  
Tomasz Waleń

2013 ◽  
Vol 756-759 ◽  
pp. 1387-1391
Author(s):  
Xiao Dong Wang ◽  
Jun Tian

Building an efficient data structure for range selection problems is considered. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size . Our data structure is a practical linear space data structure that supports range selection queries in time with preprocessing time.


2008 ◽  
Vol 179 (5) ◽  
pp. 330-338
Author(s):  
Artur Signell ◽  
Francisco Ogando ◽  
Mats Aspnäs ◽  
Jan Westerholm

Author(s):  
Peter Gjøl Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Mathias Grund Sørensen ◽  
Jakob Haar Taankvist

Sign in / Sign up

Export Citation Format

Share Document