Cycle Rank
Graph theory, Directed graph, Connectivity (graph theory)
978-620-0-97121-0
6200971218
76
2012-03-21
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786200971210.jpg
https://images.our-assets.com/fullcover/230x230/9786200971210.jpg
https://images.our-assets.com/cover/2000x/9786200971210.jpg
https://images.our-assets.com/fullcover/2000x/9786200971210.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi. Intuitively, this concept measures how close a digraph is to a directed acyclic graph, 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. Besides its original application in the studying the star height of formal languages, the measure has found use in sparse matrix computations and logic.
https://www.morebooks.de/books/pt/published_by/ject-press/189872/products
Informática, IT
https://www.morebooks.de/store/pt/book/cycle-rank/isbn/978-620-0-97121-0