𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A proof of the determinacy property of the data flow schema

✍ Scribed by Nam Sung Woo; Carl H. Smith; Ashok Agrawala

Book ID
113162732
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
326 KB
Volume
19
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Short Proof of Seymour's Characterizat
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
✍ Bertrand Guenin πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 113 KB

Seymour proved that the set of odd circuits of a signed binary matroid ðM; SÞ has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to ðMðK 4 Þ; EðK 4 ÞÞ: We give a shorter proof of this result. # 2002 Elsevier Science (USA)

A short proof of the preservation of the
A short proof of the preservation of the ωω-bounding property
✍ Chaz Schlindwein πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

## Abstract There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger versio