𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal node ranking of trees

✍ Scribed by Ananth V. Iyer; H.Donald Ratliff; G. Vijayan

Book ID
113163306
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
671 KB
Volume
28
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An optimal parallel algorithm for node r
An optimal parallel algorithm for node ranking of cographs
✍ Liu Chuan-Ming; Yu Ming-Shing πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 885 KB

A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A

Optimal ranking of tournaments
Optimal ranking of tournaments
✍ J. Spencer πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 128 KB