𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reachability Problems on Regular Ground Tree Rewriting Graphs

✍ Scribed by Christof Löding

Publisher
Springer
Year
2005
Tongue
English
Weight
471 KB
Volume
39
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of graph tree partitio
On the complexity of graph tree partition problems
✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati