370 search results - page 28 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
137
click to vote
CGF
2010
15 years 2 months ago
2010
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
110
Voted
TIT
2011
14 years 8 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
116
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduc...
114
click to vote
AI
2007
Springer
15 years 2 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
129
Voted
SIAMCOMP
2010
15 years 8 days ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...