127 search results - page 3 / 26 » The Directed Planar Reachability Problem |
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
ALGORITHMICA
2000
13 years 9 months ago
2000
GD
2004
Springer
14 years 3 months ago
2004
Springer
The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no e...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
FORMATS
2006
Springer
14 years 1 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...