论文信息 - A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph

A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph

Abstract In this short note we present a very efficient, linear time algorithm for the recognition of line digraphs. The algorithm is based on a reformulation of the characterization of line digraphs proved by Harary and Norman.

Maciej M. Syslo | M. Syslo

[1] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[2] Philippe G. H. Lehot. An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[3] R. Z. Norman,et al. Some properties of line digraphs , 1960 .