3 research outputs found
ΠΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΎΡΠ½Π°Ρ Π½Π°Π΄Π΅ΠΆΠ½ΠΎΡΡΡ ΡΠ΅ΡΠ΅Π²ΡΡ Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΠΎΠ²
Π ΡΡΠ°ΡΡΠ΅ ΡΠ΅ΠΎΡΠΈΡ Π΄ΠΎΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠ°ΡΠΏΡΠΎΡΡΡΠ°Π½Π΅Π½Π° Π½Π° Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΡ. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ 1) Π·Π°Π΄Π°ΡΠ° Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ Π΄ΠΎΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π² ΠΊΠ»Π°ΡΡΠ΅ (s, t)-Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΠΎΠ² ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½Π½ΠΎΠΉ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΠΎ ΡΠ°Π·ΡΠ΅ΡΠΈΠΌΠ°; 2) Π΄ΠΎΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠΈΠΊΠ»ΠΈΡΠ΅ΡΠΊΠΈΡ
(s, t)-Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΠΎΠ² ΡΠ°Π²Π½Π° Π½ΡΠ»Ρ, Π² ΡΠΎ Π²ΡΠ΅ΠΌΡ ΠΊΠ°ΠΊ Π·Π°Π΄Π°ΡΠ° Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ Π΄ΠΎΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π² ΠΊΠ»Π°ΡΡΠ΅ Π½Π΅ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΡΡ
r-ΡΠΈΠΊΠ»ΠΈΡΠ΅ΡΠΊΠΈΡ
(s, t)-Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΠΎΠ² ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΏΠΎΠ»Π½ΠΎΠΉ ΠΏΡΠΈ Π»ΡΠ±ΠΎΠΌ ΡΠΈΠΊΡΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠΌ Π½Π°ΡΡΡΠ°Π»ΡΠ½ΠΎΠΌ
Two-path subsets: Efficient counting and applications to performability analysis
The problem of computing performability probabilities in stochastic PERT and flow networks is studied when the network is minimally designed to withstand any two component failures. Polynomial-time algorithms to compute performability when the network is planar - the nonplanar versions being NP-hard - solve related two-path subset problems. Given an acyclic graph with weights on the arcs, the algorithms compute the total weight of all subsets of arcs that are contained in (1) two source-sink paths, or (2) two are-disjoint source-sink paths. A polynomial algorithm is given for (1), and for (2) in the case where the graph is a source-sink planar k-flow graph, that is, cdge-minimal with respect to supporting k units of flow