✦ LIBER ✦

Partitioning a Weighted Tree into Subtrees with

✍ Scribed by Takehiro Ito; Takao Nishizeki; Michael Schröder; Takeaki Uno; Xiao Zhou

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial algorithms for partitioning a

✍ N. Apollonio; I. Lari; F. Ricca; B. Simeone; J. Puerto 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

Borel partitions of infinite subtrees of

✍ A. Louveau; S. Shelah; B. Veličković 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 825 KB

The pos/neg-weighted 1-median problem on

✍ Yukun Cheng; Liying Kang; Changhong Lu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A methodology for partitioning a vocabul

✍ Huanying (Helen) Gu; Yehoshua Perl; James Geller; Michael Halper; Mansnimar Sing 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Constructing a Tree from Homeomorphic Su

✍ M. R. Henzinger; V. King; T. Warnow 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 125 KB

Largest Number of Subtrees of Trees with

✍ Kirk, Russell; Wang, Hua 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB