𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the combinatorial sufficient conditions for linear network solvability

✍ Scribed by András Recski; Judit Takács

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
238 KB
Volume
9
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient Conditions for the Oscillatio
Sufficient Conditions for the Oscillation of Linear Delay Difference Equations with Oscillating Coefficients
✍ J.S. Yu; X.H. Tang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 67 KB

In this paper sufficient conditions for the oscillation of all solutions of the delay difference equation x y x q p x s 0, n s 0, 1, 2, . . . , are established, where the coefficient p itself may be allowed to be oscillatory. We also give an n example to demonstrate the advantage of our results.

Linear time algorithms for computing the
Linear time algorithms for computing the most reliable source on an unreliable tree network
✍ Xue, Guoliang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a