190
click to vote
LATIN
16 years 12 days ago
2010 Springer 
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
139
click to vote
LATIN
16 years 12 days ago
2010 Springer 
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
161
Voted
LATIN
15 years 9 months ago
2010 Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
178
click to vote
LATIN
16 years 1 days ago
2010 Springer
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
|
Information Technology