We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
R. Andres Cortez, Herbert G. Tanner, Ron Lumia, Ch...
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
— This paper addresses a novel visibility-based pursuit-evasion problem in which a team of searchers with limited range sensors must coordinate to clear any evaders from an unkno...
Joseph W. Durham, Antonio Franchi, Francesco Bullo
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...