We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...