An algorithmic characterization of total digraphs (original) (raw)

Journal of Algorithms, 1986

Abstract

ABSTRACT We consider total digraphs of digraphs and present: (i) a structural characterization, (ii) an algorithmic characterization based on a labeling procedure, and (iii) an efficient recognition algorithm. The computational complexity of the algorithm is dominated by the complexity of finding the square of a Boolean (adjacency) matrix of a digraph.

Christina Zamfirescu hasn't uploaded this paper.

Let Christina know you want this paper to be uploaded.

Ask for this paper to be uploaded.