High Quality Content by WIKIPEDIA articles! In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Buchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a DAG has cycle rank zero, while a complete digraph of order n with a self-loop at each vertex has cycle rank n. When applied to undirected graphs, the concept of cycle rank bears many different names in the research literature, including vertex ranking number, ordered chromatic number, minimum elimination tree height and tree-depth (Bodlaender et al. 1998, Rossman 2008) Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в среде Интернет в целом, и в информационном сетевом ресурсе "Википедия" в частности. Собранная по частотным запросам указанной тематики, данная компиляция построена по принципу подбора близких информационных ссылок, не имеет самостоятельного...