4 papers
On embedding degree sequences
Béla Csaba, Bálint Vásárhelyi
Assume that we are given two graphic sequences, and . We consider conditions for and which guarantee that there exists a simple graph realizing s…
On the relation of separability, bandwidth and embedding
Béla Csaba, Bálint Vásárhelyi
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spannin…
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…
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.