✦ LIBER ✦

On weighted multiway cuts in trees

✍ Scribed by Péter L. Erdős; László A. Székely

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 751 KB
Volume: 65
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581691

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum multiway cuts in trees

✍ Péter L. Erdős; András Frank; László Székely 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 667 KB

We compare three lower bounds for the minimum cardinality of a multiway cut in a graph separating a given set S of terminals. The main result is a relatively short algorithmic proof for a simplified version of a min-max theorem of the first and the third authors asserting that the best of the three

A note on optimal multiway split trees

✍ L. T. Liu; Gen-Huey Chen; Yue-Li Wang 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 493 KB

Initial point search on weighted trees

✍ Kensaku Kikuta; William H. Ruckle 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

Computing marginal probabilities in caus

Computing marginal probabilities in causal multiway trees given incomplete information

✍ Gerald R. Garside; Paul C. Rhodes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 951 KB

On the spanning trees of weighted graphs

✍ Ernst W. Mayr; C. Greg Plaxton 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 874 KB

Non-uniform random spanning trees on wei

Non-uniform random spanning trees on weighted graphs

✍ M. Mosbah; N. Saheb 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 547 KB