Digraph Complexity Measures and Applications in Formal Language Theory

@article{Gruber2012DigraphCM,
  title={Digraph Complexity Measures and Applications in Formal Language Theory},
  author={Hermann Gruber},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2012},
  volume={14},
  pages={189-204}
}
  • Hermann Gruber
  • Published 2012 in
    Discrete Mathematics & Theoretical Computer…
We give an overview of some structural complexity measures and width parameters on digraphs, relate them to each other, and discuss their computational complexity aspects. Particular attention is given to cycle rank, perhaps the oldest of these measures to be studied in the literature, which turns out to be intimately related to structural and descriptional… CONTINUE READING