𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probability, Truth and Flow Graph

✍ Scribed by Zdzisław Pawlak


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
785 KB
Volume
82
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Balanced graphs and network flows
✍ Penrice, Stephen G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com