Suchergebnisse - "space-efficient algorithms"

Space-efficient algorithms for reachability in directed geometric graphs von Bhore, Sujoy, Jain, Rahul

“… The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability …”
Volltext

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs von Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni

“… The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of …”
Volltext

Lightweight Data Indexing and Compression in External Memory von Ferragina, Paolo, Gagie, Travis, Manzini, Giovanni

“… In this paper we describe algorithms for computing the Burrows-Wheeler Transform (bwt) and for building (compressed) indexes in external memory. The innovative …”
Volltext

Space Efficient Linear Time Algorithms for BFS, DFS and Applications von Banerjee, Niranka, Chakraborty, Sankardeep, Raman, Venkatesh, Satti, Srinivasa Rao

“… Research on space efficient graph algorithms, particularly for st -connectivity, has a long history including the celebrated polynomial time, O (lg n ) bits 1 …”
Volltext

Space Saving by Dynamic Algebraization Based on Tree-Depth von Fürer, Martin, Yu, Huiwen

“… Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the …”
Volltext

Fast BWT in small space by blockwise suffix sorting von Kärkkäinen, Juha

“… We present a new space- and time-efficient algorithm for computing the Burrow–Wheeler transform (BWT). For any choice of a parameter v ∈ [ 3 , n 2 / 3 ] , the …”
Volltext

Space-efficient parallel algorithms for combinatorial search problems von Pietracaprina, A., Pucci, G., Silvestri, F., Vandin, F.

“… We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving …”
Volltext

Prune-and-search with limited workspace von De, Minati, Nandy, Subhas C., Roy, Sasanka

“… Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and …”
Volltext

Space-efficient geometric divide-and-conquer algorithms von Bose, Prosenjit, Maheshwari, Anil, Morin, Pat, Morrison, Jason, Smid, Michiel, Vahrenhold, Jan

“… We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset …”
Volltext

Line-segment intersection made in-place von Vahrenhold, Jan

“… We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant …”
Volltext

Space Efficient Algorithms for Ordered Tree Comparison von Wang, Lusheng, Zhang, Kaizhong

“… In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the …”
Volltext

Finding an optimal path without growing the tree von Chen, Danny Z., Daescu, Ovidiu, Hu, Xiaobo (Sharon), Xu, Jinhui

“… For problems on computing an optimal path as well as its length in a certain setting, the “standard” approach for finding an actual optimal path is by building …”
Volltext

Longest common subsequence in sublinear space von Kiyomi, Masashi, Horiyama, Takashi, Otachi, Yota

“… •The first o(n)-space polynomial-time algorithm for the longest common subsequence problem is presented.•Levenshtein distance can be computed in the same time …”
Volltext

Space-efficient algorithm for computing a centerpoint of a set of points in R2 von Bhattacharya, Binay K., Nandy, Subhas C., Roy, Sasanka

“… We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R2, where the points in P are given in a read-only array. We …”
Volltext

Space-Efficient Algorithms for Longest Increasing Subsequence von Kiyomi, Masashi, Ono, Hirotaka, Otachi, Yota, Schweitzer, Pascal, Tarui, Jun

“… Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O n log n time …”
Volltext

Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time von Brönnimann, Hervé, Chan, Timothy M.

“… We present space-efficient algorithms for computing the convex hull of a simple polygonal line in-place, in linear time. It turns out that the problem is as …”
Volltext

Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs von Bateni, MohammadHossein, Monemzadeh, Morteza, Voorintholt, Kees

“… In recent years, the Massively Parallel Computation (MPC) model capturing the MapReduce framework has become the de facto standard model for large-scale data …”
Volltext

Reassembling polygons from edges von Hartley, Richard I.

“… Many geometric algorithms accept as input a set of polygons specified by their sequence of vertices and give as output a set of polygons which result from some …”
Volltext