127 search results - page 4 / 26 » The Directed Planar Reachability Problem |
ADG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper, we introduce the concept of planar generalized Stewart platform (GSP) consisting of two rigid bodies connected with three constraints between three pairs o...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
FORMATS
2005
Springer
14 years 3 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
TABLEAUX
2009
Springer
14 years 4 months ago
2009
Springer
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...