𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of Menger’s Theorem

✍ Scribed by Sunil Mathew; M.S. Sunitha

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
226 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role in many areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs.

📜 SIMILAR VOLUMES

Vulnerability of scheduled networks and
Vulnerability of scheduled networks and a generalization of Menger's Theorem
✍ Berman, Kenneth A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 859 KB

An edge-scheduled network N is a multigraph G = (V, E), where each edge e E E has been assigned two real weights: a start time a(e) and a finish time p(e). Such a multigraph models a communication or transportation network. A multiedge joining vertices u and v represents a direct communication (tran

Menger's Theorem
Menger's Theorem
✍ T. Böhme; F. Göring; J. Harant 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

## Abstract Menger's Theorem for digraphs states that for any two vertex sets __A__ and __B__ of a digraph __D__ such that __A__ cannot be separated from __B__ by a set of at most __t__ vertices, there are __t + 1__ disjoint __A__–__B__‐paths in __D__. Here a short and elementary proof of a more ge