✦ LIBER ✦

The k best spanning arborescences of a network

✍ Scribed by P. M. Camerini; L. Fratta; F. Maffioli

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 998 KB
Volume: 10
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230100202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding the K best cuts in a network

✍ Horst W. Hamacher; Jean-Claude Picard; Maurice Queyranne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 145 KB

An O(K·n4) algorithm for finding the k b

An O(K·n4) algorithm for finding the k best cuts in a network

✍ Horst Hamacher 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Solutions of the kth best route through

Solutions of the kth best route through a network — A review

✍ Maurice Pollack 📂 Article 📅 1961 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Which Properties of a Spanning Network o

Which Properties of a Spanning Network of Hydration Water Enable Biological Functions?

✍ Ivan Brovchenko; Alla Oleinikova 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB

Spanning subgraphs of k-connected digrap

Spanning subgraphs of k-connected digraphs

✍ Daniel A Marcus 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 600 KB

The maximum number of arc-disjoint arbor

The maximum number of arc-disjoint arborescences in a tournament

✍ Ma Chung-fan; Cai Mao-cheng 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

## Abstract In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete __r__‐partite graph by means of the indegrees of its vertices.