5889 search results - page 224 / 1178 » Graph Layout Problems |
193
click to vote
WADS
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
147
click to vote
SIAMCO
2008
15 years 7 months ago
2008
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
183
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
195
Voted
IAT
2005
IEEE
16 years 19 days ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
207
click to vote
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...