Showing 2016Show all
2 papers · 1 filter
math.CO2016
An Estimation of the Size of Non-Compact Suffix Trees
Bálint Vásárhelyi
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slig…
math.CO2016
On the bipartite graph packing problem
Bálint Vásárhelyi
The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.