ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
ICRA
2003
IEEE
14 years 4 months ago
2003
IEEE
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...