Matches in DBpedia 2016-04 for { ?s ?p "In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close adigraph is to a directed acyclic graph (DAG), in the sense that a DAG hascycle rank zero, while a complete digraph of order n with a self-loop ateach vertex has cycle rank n. The cycle rank of a directed graph is closely related to the tree-depth of an undirected graph and to the star height of a regular language."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Cycle_rank comment "In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close adigraph is to a directed acyclic graph (DAG), in the sense that a DAG hascycle rank zero, while a complete digraph of order n with a self-loop ateach vertex has cycle rank n. The cycle rank of a directed graph is closely related to the tree-depth of an undirected graph and to the star height of a regular language.".
- Q5198174 comment "In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close adigraph is to a directed acyclic graph (DAG), in the sense that a DAG hascycle rank zero, while a complete digraph of order n with a self-loop ateach vertex has cycle rank n. The cycle rank of a directed graph is closely related to the tree-depth of an undirected graph and to the star height of a regular language.".