𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Direct and Indirect Covering Trees

✍ Scribed by Justin C. Williams


Book ID
111558314
Publisher
Springer US
Year
2003
Tongue
English
Weight
159 KB
Volume
123
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Covering directed graphs by in-trees
✍ Naoyuki Kamiyama; Naoki Katoh πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 646 KB
Optimal Labellings of Rooted Directed Tr
✍ Jia-yu Shao πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 200 KB

We consider an optimal labelling problem for a rooted directed tree abbreviated . as ''RDT'' which is motivated by certain scheduling problem. We obtain several necessary and sufficient conditions for the optimal labellings of a RDT and give a polynomially bounded algorithm for constructing the opti