1461 search results - page 191 / 293 » Complexity of Graph Covering Problems |
176
click to vote
ICCSA
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
168
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
180
click to vote
INFOCOM
2008
IEEE
16 years 21 days ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
160
click to vote
CP
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
163
click to vote
SIAMNUM
2011
15 years 1 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...