115
click to vote
ISAAC
15 years 6 months ago
2007 Springer 
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
114
click to vote
ISAAC
15 years 6 months ago
2007 Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
112
click to vote
ISAAC
15 years 6 months ago
2007 Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
110
click to vote
ISAAC
15 years 6 months ago
2007 Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
ISAAC
15 years 6 months ago
2007 Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
|
Algorithms