The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance
We study the (Delta,D) and (Delta,N) problems for double-step digraphs considering the Warewashing:Other Cleaning unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by changing the directions of all the arcs.The first problem consists of maximizing the number of vertices