Skip to search formSkip to main contentSkip to account menu

Reachability

Known as: Graph reachability, Reach 
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The communication in Mobile Ad hoc Network (MANET) is multi-hop in nature wherein each node relays data packets of other nodes… 
2010
2010
Research in Vehicular Ad hoc Networks (VANETs) has found in simulation the most useful method to test new algorithms and… 
Highly Cited
2009
Highly Cited
2009
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on… 
Highly Cited
2008
Highly Cited
2008
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise… 
Highly Cited
2006
Highly Cited
2006
The realization problem for positive multivariable discrete-time systems with delays in the state and inputs is formulated and… 
Highly Cited
2006
Highly Cited
2006
With the provision of various wireless services, e.g., third-generation (3G) and wireless local area network (WLAN), more and… 
1984
1984
In older to specify dytxmi (' con-strc int?, we ~lrcsfnt * a siclplifjcd vel-sion of teopcltal lccic hasec! on the tenporal…