𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum integer multiterminal flow problem in directed graphs

✍ Scribed by Cédric Bentz

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
155 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum flow in probabilistic graphs-the
Maximum flow in probabilistic graphs-the discrete case
✍ J. R. Evans 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 912 KB

## Abstract Frank and Frisch have considered the problem of determining the maximum flow probability distribution in networks where each branch has capacity that is a continuous random variable. In this paper, we consider the branch capacity distributions to be discrete and investigate some theoret

The degree-preserving spanning tree prob
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ ε __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn