13603 search results - page 179 / 2721 » On the Complexity of Computing Treelength |
172
click to vote
SI3D
2003
ACM
15 years 9 months ago
2003
ACM
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
128
click to vote
IJCAI
2007
15 years 5 months ago
2007
Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
137
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
131
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
131
click to vote
FCT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...