The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...