193 search results - page 6 / 39 » Duality in Infinite Graphs |
SIAMCO
2008
13 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
ICRA
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper extends the kinematic manipulability concept commonly used for serial manipulators to general constrained rigid multibody systems. Examples of such systems include multi...
JGT
2010
13 years 5 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...